1772 search results - page 118 / 355 » Classifying Problems into Complexity Classes |
201
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
168
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
172
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
194
click to vote
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
159
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...