• DocumentCode
    2645582
  • Title

    Clique is hard to approximate within n1-ϵ

  • Author

    Håstad, Johan

  • Author_Institution
    R. Inst. of Technol., Stockholm, Sweden
  • fYear
    1996
  • fDate
    14-16 Oct 1996
  • Firstpage
    627
  • Lastpage
    636
  • Abstract
    The author proves that unless NP=coR, Max Clique is hard to approximate in polynomial time within a factor n1-ε for any ε>0. This is done by, for any δ>0, constructing a proof system for NP which uses δ amortized free bits. A central lemma, which might be of independent interest, gives sufficient conditions (in the form of a certain type of agreement) for creating a global function from local functions certain local consistency conditions
  • Keywords
    approximation theory; computational complexity; theorem proving; Max Clique approximation; amortized free bits; global function; local consistency conditions; local functions; polynomial time; proof system; Approximation algorithms; History; Microwave integrated circuits; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
  • Conference_Location
    Burlington, VT
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-7594-2
  • Type

    conf

  • DOI
    10.1109/SFCS.1996.548522
  • Filename
    548522
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2645582