Sciweavers

Share
COCO
2004
Springer
91views Algorithms» more  COCO 2004»
9 years 1 months ago
Compression of Samplable Sources
We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression and decompression algorithms for three classes of such sources ...
Luca Trevisan, Salil P. Vadhan, David Zuckerman
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
9 years 1 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
9 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
119views Algorithms» more  COCO 2004»
9 years 1 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
9 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
118views Algorithms» more  COCO 2004»
9 years 3 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
9 years 3 months ago
On Pseudoentropy versus Compressibility
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
Hoeteck Wee
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
9 years 3 months ago
On the Power of Quantum Proofs
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
Ran Raz, Amir Shpilka
COCO
2004
Springer
86views Algorithms» more  COCO 2004»
9 years 3 months ago
Deterministic Polynomial Identity Testing in Non-Commutative Models
We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:
Ran Raz, Amir Shpilka
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
9 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
books