143
click to vote
COCO
15 years 6 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 ...
111
click to vote
COCO
15 years 6 months ago
1994 Springer 
We show the following results regarding complete sets.
109
click to vote
COCO
15 years 6 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
15 years 6 months ago
1994 Springer |
Algorithms