145
click to vote
COCO
15 years 10 months ago
2007 Springer 
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
121
Voted
COCO
15 years 10 months ago
2007 Springer 
There exists a positive constant α < 1 such that for any function T(n) ≤ nα and for any problem L ∈ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T...
122
click to vote
COCO
15 years 10 months ago
2007 Springer 
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
133
Voted
COCO
15 years 7 months ago
2007 Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
126
click to vote
COCO
15 years 10 months ago
2007 Springer 
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
|
Algorithms