• DocumentCode
    3242695
  • Title

    Comparing notions of full derandomization

  • Author

    Fortnow, Lance

  • Author_Institution
    NEC Res. Inst., Princeton, NJ, USA
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    28
  • Lastpage
    34
  • Abstract
    Most of the hypotheses of full derandomization fall into two sets of equivalent statements: those equivalent to the existence of efficient pseudorandom generators and those equivalent to approximating the accepting probability of a circuit. We give the first relativized world where these sets of equivalent statements are not equivalent to each other
  • Keywords
    computational complexity; probability; circuit accepting probability; efficient pseudorandom generators; equivalent statements; full derandomization; relativized world; Books; Circuits; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 16th Annual IEEE Conference on, 2001.
  • Conference_Location
    Chicago, IL
  • Print_ISBN
    0-7695-1053-1
  • Type

    conf

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