• DocumentCode
    2144508
  • Title

    On the resource bounded measure of P/poly

  • Author

    Köbler, Johannes ; Lindner, Wolfgang

  • Author_Institution
    Theor. Inf., Ulm Univ., Germany
  • fYear
    1998
  • fDate
    15-18 Jun 1998
  • Firstpage
    182
  • Lastpage
    185
  • Abstract
    We show that the class of sets having polynomial size circuits, P/poly, has EXPNP-measure zero under each of the following two assumptions: EXPNP≠ZPP(Σ2p)(which holds if the polynomial time hierarchy does not collapse to ZPP(Σ2 p)), or NP is not small (does not have EXP-measure zero)
  • Keywords
    computational complexity; EXP-measure zero; NP; P/poly; polynomial size circuits; polynomial time hierarchy; resource bounded measure; Books; Circuits; Cryptography; Polynomials; Security; Size measurement; Time measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 1998. Proceedings. Thirteenth Annual IEEE Conference on
  • Conference_Location
    Buffalo, NY
  • ISSN
    1093-0159
  • Print_ISBN
    0-8186-8395-3
  • Type

    conf

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