Title of article
Probabilistically checkable proofs and their consequences for approximation algorithms Original Research Article
Author/Authors
S. Hougardy، نويسنده , , H.J. Pr?mel، نويسنده , , A. Steger، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
49
From page
175
To page
223
Abstract
The aim of this paper is to present a self-contained proof of the spectacular recent achievement that NP = PCP (log n, 1). We include, as consequences, results concerning nonapproximability of the clique number, as well as of the chromatic number of graphs, and of MAX-SNP hard problems.
Journal title
Discrete Mathematics
Serial Year
1994
Journal title
Discrete Mathematics
Record number
943423
Link To Document