Probabilistic Verification and Non-Approximability

Mario Szegedy ()
Additional contact information
Mario Szegedy: the State University of NJ, Department of Computer Science Rutgers

A chapter in Handbook of Combinatorial Optimization, 2004, pp 83-191 from Springer

Keywords: Chromatic Number; Constraint Satisfaction Problem; Proof System; Annual Symposium; Random Line (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-23830-2_3

Ordering information: This item can be ordered from
http://www.springer.com/9780387238302

DOI: 10.1007/0-387-23830-1_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().