Original title: Probabilistic proofs and NP-completeness ( A course on the PCP theorem and itsconsequences )
Authors: Sgall, Jiří
Document type: Research reports
Year: 2002
Language: eng
Abstract: Lecture notes.
Keywords: approximation algorithms; computational complexity
Project no.: LN00A056 (CEP), IAA1019901 (CEP), GA201/01/1195 (CEP), ME 476
Funding provider: GA MŠk, GA AV ČR, GA ČR, GA MŠk

Institution: Institute of Mathematics AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0072214

Permalink: http://www.nusl.cz/ntk/nusl-26011


The record appears in these collections:
Research > Institutes ASCR > Institute of Mathematics
Reports > Research reports