×

Found 2 Documents (Results 1–2)

Efficient probabilistically checkable debates. (English) Zbl 1343.68026

Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17–19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 519-529 (2011).
MSC:  68M12 68Q15 68Q25
PDFBibTeX XMLCite
Full Text: DOI Link

A PCP characterization of AM. (English) Zbl 1333.68117

Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 581-592 (2011).
MSC:  68Q15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Author

Main Field