2661 search results - page 122 / 533 » Quantum Complexity Classes |
124
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
122
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
159
click to vote
FUN
2010
Springer
15 years 8 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...
133
click to vote
COLT
1993
Springer
15 years 7 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
157
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...