Change search
ReferencesLink to record
Permanent link

Direct link
Complexity theory, proofs and approximation
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.ORCID iD: 0000-0002-5379-345X
2005 (English)In: European Congress of Mathematics / [ed] Laptev, A, 2005, 733-750 p.Conference paper (Refereed)
Abstract [en]

We give a short introduction to some questions in complexity theory and proceed to describe some recent developments. In particular, we discuss probabilistically checkable proofs and their applications in establishing inapproximability results. In a traditional proof the proof-checker reads the entire proof and decides deterministically whether the proof is correct. In a probabilistically checkable proof the proof-checker randomly verifies only a very small portion of the proof but still cannot be fooled into accepting a false claim except with small probability.

Place, publisher, year, edition, pages
2005. 733-750 p.
National Category
URN: urn:nbn:se:kth:diva-43290DOI: 10.4171/009-1/46ISI: 000231730600046ISBN: 3-03719-009-4OAI: diva2:448604
4th European Congress of Mathematics (4ECM) Location: Stockholm, SWEDEN Date: JUN 27-JUL 02, 2004

QC 20111017

Available from: 2011-10-17 Created: 2011-10-14 Last updated: 2012-09-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Håstad, Johan
By organisation
Numerical Analysis and Computer Science, NADA

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 30 hits
ReferencesLink to record
Permanent link

Direct link