COCO
1994
Springer
13 years 9 months ago
1994
Springer
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...
COCO
1994
Springer
13 years 9 months ago
1994
Springer
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...
COCO
1994
Springer
13 years 9 months ago
1994
Springer
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 ...
COCO
1994
Springer
13 years 9 months ago
1994
Springer
COCO
1994
Springer
13 years 9 months ago
1994
Springer
We show the following results regarding complete sets.
COCO
1994
Springer
13 years 9 months ago
1994
Springer
COCO
1994
Springer
13 years 9 months ago
1994
Springer
COCO
1994
Springer
13 years 9 months ago
1994
Springer
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...