|
Published Articles >> Table of Contents >> Abstract
45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)
pp. 136-145
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique
Subhash Khot, Georgia Tech University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2004.59
Send link to a friend
| Abstract |
|
Assuming that NP ⊈ ∩_ε > 0 BPTIME(2^n^ε), we show that GraphMin-Bisection, Densest Subgraph and Bipartite Clique have no PTAS. We give a reduction from the Minimum Distance of Code Problem (MDC). Starting with an instance of MDC, we build a Quasi-random PCP that suffices to prove the desired inapproximability results. In a Quasi-random PCP, the query pattern of the verifier looks random in some precise sense. Among the several new techniques introduced, we give a way of certifying that a given polynomial belongs to a given subspace of polynomials. As is important for our purpose, the certificate itself happens to be another polynomial and it can be checked by reading a constant number of its values.
|
 Additional Information
|
Citation:
Subhash Khot,
"Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique,"
focs,
pp. 136-145,
45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04),
2004
|
|
