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