Summer has come again. And what better way is there to spend a summer than to relax on a sandy beach, on a mountain top, or at a park's picnic tables, and... think theory ! Summer is a particularly good time to attack the big questions whose openness just plain annoys you. In light of Reingold's L = SL result, does L-vs.-RL tempt you? If so, take it on! (But perhaps peek first at Reingold--Trevisan--Vadhan's ECCC TR05-022.) Are you convinced that UP = NP should imply the collapse of the polynomial hierarchy? Make it so! (But if you hope to do so via showing that UP is contained in the low hierarchy, peek first at Long--Sheu's 1996 MST article.) You know that S 2 ⊆ S NP∩coNP 2 ⊆ ZPP NP and S NP 2 ⊆ ZPP NP NP , but believe that some of those "⊆"s are "=" s or are (gasp!) provably strict containments (thus giving some insight into whether recent improvements (Cai in FOCS 2001; Cai et al. in Information and Computation 2005) in the collapses of the polynomial hierarchy from assumptions that NP is in P/poly, (NP ∩ coNP)/poly, or coNP/poly are strict improvements)? Well, prove an "=" or find evidence for a strict containment... or to really make this a summer for us all to remember, prove a strict containment! Wishing you happy theorems.This article gives an overview of recent PCP constructions based on the Long Code and the inapproximability results implied by these constructions. We cover the inapproximability results for (1) MAX-3SAT and CLIQUE (2) Results for SPARSEST CUT, VERTEX COVER and MAX-CUT implied by the Unique Games Conjecture and (3) HYPERGRAPH VERTEX COVER and coloring problems on hypergraphs. The article aims at explaining the general framework that, loosely speaking, incorporates all the above results.
Guest column: inapproximability results via Long Code based PCPs
SIGACT News Complexity Theory Column 47 Lane A. Hemaspaandra Dept. of Computer Science, University of Rochester Rochester, NY 14627, USA Introduction to Complexity Theory Column 47 Summer has come again. And what better way is there to spend a summer than to relax on a sandy beach, on a mountain top, or at a park s picnic tables, and. . . think theory! Summer is a particularly good time to attack the big questions whose openness just plain annoys you. In light of Reingold s L = SL result, does L-vs.-RL tempt you? If so, take it on! (But perhaps peek rst at Reingold Trevisan Vadhan s ECCC TR05-022.) Are you convinced that UP = NP should imply the collapse of the polynomial hierarchy? Make it so! (But if you hope to do so via showing that UP is contained in the low hierarchy, peek rst at Long Sheu s 1996 MST article.) You know that NP ©coNP ZPPNP and SNP ZPPNPNP , but believe that some of those s are = s or are S2 S2 2 (gasp!) provably strict containments (thus giving some insight into whether recent improvements (Cai in FOCS 2001; Cai et al. in Information and Computation 2005) in the collapses of the polynomial hierarchy from assumptions that NP is in P/poly, (NP © coNP)/poly, or coNP/poly are strict improvements)? Well, prove an = or nd evidence for a strict containment. . . or to really make this a summer for us all to remember, prove a strict containment! Wishing you happy theorems. Warmest thanks to Subhash for this month s guest column, Inapproximability Results via Long Code Based PCPs. Upcoming articles include John Hitchcock, Jack Lutz, and Elvira Mayordomo on The Fractal Geometry of Complexity Classes, Neil Immerman on Recent Progress in Descriptive Complexity, Piotr Faliszewski and me on Five Not-So-Easy Questions about the Semifeasible Sets, and Omer Reingold on a topic TBA. Guest Column: Inapproximability Results via Long Code based PCPs1 Subhash Khot2 Abstract This article gives an overview...
End of preview. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/guest-column-inapproximability-results-via-long-code-based-pcps-8GZjoTlVT6
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Guest column: inapproximability results via Long Code based PCPs
Khot, Subhash
Follow ACM SIGACT News
, Volume 36 (2)
Association for Computing Machinery – Jun 1, 2005
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
