Sciweavers

COCO
2004
Springer
104views Algorithms» more  COCO 2004»
13 years 9 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
13 years 9 months ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
13 years 9 months ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
13 years 9 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
COCO
2004
Springer
95views Algorithms» more  COCO 2004»
13 years 9 months ago
Consequences and Limits of Nonlocal Strategies
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...
Richard Cleve, Peter Høyer, Benjamin Toner,...
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
13 years 9 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka
COCO
2004
Springer
106views Algorithms» more  COCO 2004»
13 years 9 months ago
Separating Complexity Classes Using Structural Properties
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
Harry Buhrman, Leen Torenvliet
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
13 years 9 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
COCO
2004
Springer
93views Algorithms» more  COCO 2004»
13 years 9 months ago
Lower Bounds for Testing Bipartiteness in Dense Graphs
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
Andrej Bogdanov, Luca Trevisan
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
13 years 9 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang