Sciweavers

COCO
1994
Springer
102views Algorithms» more  COCO 1994»
14 years 3 months ago
Alternation in Interaction
We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the rst prover is trying to convince a veri er to accept and the secon...
Marcos A. Kiwi, Carsten Lund, Alexander Russell, D...
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
14 years 3 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 3 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
COCO
1994
Springer
90views Algorithms» more  COCO 1994»
14 years 3 months ago
On the Structure of Complete Sets
We show the following results regarding complete sets.
Harry Buhrman, Leen Torenvliet
COCO
1994
Springer
86views Algorithms» more  COCO 1994»
14 years 3 months ago
Random Strings Make Hard Instances
Harry Buhrman, Pekka Orponen
COCO
1994
Springer
82views Algorithms» more  COCO 1994»
14 years 3 months ago
Time, Hardware, and Uniformity
David A. Mix Barrington, Neil Immerman
COCO
1994
Springer
89views Algorithms» more  COCO 1994»
14 years 3 months ago
Relationships Among PL, #L, and the Determinant
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
Eric Allender, Mitsunori Ogihara