Sciweavers

COCO
2004
Springer
185views Algorithms» more  COCO 2004»
14 years 1 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
COCO
2004
Springer
156views Algorithms» more  COCO 2004»
14 years 3 months ago
Multiparty Quantum Coin Flipping
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, He...
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
14 years 1 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 3 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
14 years 3 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
Algorithms
Top of PageReset Settings