• DocumentCode
    2366945
  • Title

    The shrinkage exponent is 2

  • Author

    Håstad, Johan

  • Author_Institution
    R. Inst. of Technol., Stockholm, Sweden
  • fYear
    1993
  • fDate
    3-5 Nov 1993
  • Firstpage
    114
  • Lastpage
    123
  • Abstract
    We prove that if we hit a formula of size L with a random restriction from Rp then the expected remaining size is at most O(p2(log p)3/2L). As a corollary we obtain a R(n3-O(1)) formula size lower bound for an explicit function in NP
  • Keywords
    computational complexity; NP; explicit function; random restriction; shrinkage exponent; Computational modeling; Inspection; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
  • Conference_Location
    Palo Alto, CA
  • Print_ISBN
    0-8186-4370-6
  • Type

    conf

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