Number of the records: 1
Probabilistic proofs and NP-completeness ( A course on the PCP theorem and itsconsequences )
- 1.0175229 - MU-W 20020117 RIV CZ eng V - Research Report
Sgall, Jiří
Probabilistic proofs and NP-completeness ( A course on the PCP theorem and itsconsequences ).
Praha: Charles University, 2002. 30 s.
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠMT ME 476
Keywords : computational complexity * approximation algorithms
Subject RIV: BA - General Mathematics
Lecture notes.
Permanent Link: http://hdl.handle.net/11104/0072214
Number of the records: 1