Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

61

Voted

COCO
1992
Springer

92views Algorithms» more COCO 1992»

Interactive Proof Systems with Polynomially Bounded Strategies

15 years 6 months ago

Interactive Proof Systems with Polynomially Bounded Strategies

Download www.cs.ubc.ca

Anne Condon, Richard E. Ladner

Real-time Traffic

Algorithms | COCO 1992 |

claim paper

Related Content

» Interactive Proofs with Space Bounded Provers

» Generalized Tsirelson Inequalities CommutingOperator Provers and Multiprover Interactive P...

» Random Cnfs are Hard for the Polynomial Calculus

» Guiding Program Development Systems by a Connection Based Proof Strategy

» Polynomial Interpretations and the Complexity of Algorithms

» The Proof Complexity of Polynomial Identities

» Algebraic Proofs over Noncommutative Formulas

» PSPACE Has ConstantRound Quantum Interactive Proof Systems

» On the Automatizability of Resolution and Related Propositional Proof Systems

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1992
Where	COCO
Authors	Anne Condon, Richard E. Ladner

Comments (0)