130
Voted
COCO
15 years 4 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 ...
103
Voted
COCO
15 years 4 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...
101
Voted
COCO
15 years 4 months ago
1994 Springer 
We show the following results regarding complete sets.
97
Voted
COCO
15 years 4 months ago
1994 Springer  COCO
15 years 4 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...
|
Algorithms