• DocumentCode
    1632540
  • Title

    Hardness amplification within NP

  • Author

    O´Donnell, Ryan

  • Author_Institution
    Appl. Math. Dept., MIT, MA, USA
  • fYear
    2002
  • fDate
    6/24/1905 12:00:00 AM
  • Firstpage
    13
  • Lastpage
    13
  • Abstract
    We investigate whether, if NP is slightly hard on average, it is very hard on average
  • Keywords
    computational complexity; NP; hardness amplification; Application software; Boolean functions; Circuits; Computational complexity; Electron traps; Mathematics; Polynomials; Stability analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
  • Conference_Location
    Montreal, Que.
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-1468-5
  • Type

    conf

  • DOI
    10.1109/CCC.2002.1004332
  • Filename
    1004332
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1632540