202
Voted
COCO
15 years 11 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 ...
172
click to vote
COCO
15 years 11 months ago
1994 Springer 
We show the following results regarding complete sets.
161
click to vote
COCO
15 years 11 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...
160
click to vote
COCO
15 years 11 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