Sciweavers

21 search results - page 5 / 5
» On Optimal Strategies for a Hat Game on Graphs
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 9 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
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 ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...