Comparing notions of full derandomization

Comparing notions of full derandomization

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 equ...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Fortnow, L.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Circuits
Polynomials
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 34
container_issue
container_start_page 28
container_title
container_volume
creator Fortnow, L.
description 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.
doi_str_mv 10.1109/CCC.2001.933869
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_933869</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>933869</ieee_id><sourcerecordid>933869</sourcerecordid><originalsourceid>FETCH-LOGICAL-i104t-7cd97468831db60abee9491e3669d674c80bb1c3cf870e3fd8741ca4569b80313</originalsourceid><addsrcrecordid>eNotjztLA0EURgdEUGNqwWrbFLu51zvPMgxqAgEbrcM8ZWR3J-zGQn-9SvyaUxw48DF2h9Ahgllba7sHAOwMkZbmgt2AkkYgCMIrtpznD_gdF1wLfc1Wtg5HN5XxvRnrqdRxbmpu8mffNzFNbox1KN_uT9yyy-z6OS3_uWBvT4-vdtvuX553drNvCwI_tSpEo7jUmjB6Cc6nZLjBRFKaKBUPGrzHQCFrBYly1IpjcFxI4zUQ0oLdn7slpXQ4TmVw09fhfIZ-AAjJPmk</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Comparing notions of full derandomization</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Fortnow, L.</creator><creatorcontrib>Fortnow, L.</creatorcontrib><description>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.</description><identifier>ISBN: 0769510531</identifier><identifier>ISBN: 9780769510538</identifier><identifier>DOI: 10.1109/CCC.2001.933869</identifier><language>eng</language><publisher>IEEE</publisher><subject>Circuits ; Polynomials</subject><ispartof>Proceedings 16th Annual IEEE Conference on Computational Complexity, 2001, p.28-34</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/933869$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/933869$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Fortnow, L.</creatorcontrib><title>Comparing notions of full derandomization</title><title>Proceedings 16th Annual IEEE Conference on Computational Complexity</title><addtitle>CCC</addtitle><description>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.</description><subject>Circuits</subject><subject>Polynomials</subject><isbn>0769510531</isbn><isbn>9780769510538</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2001</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjztLA0EURgdEUGNqwWrbFLu51zvPMgxqAgEbrcM8ZWR3J-zGQn-9SvyaUxw48DF2h9Ahgllba7sHAOwMkZbmgt2AkkYgCMIrtpznD_gdF1wLfc1Wtg5HN5XxvRnrqdRxbmpu8mffNzFNbox1KN_uT9yyy-z6OS3_uWBvT4-vdtvuX553drNvCwI_tSpEo7jUmjB6Cc6nZLjBRFKaKBUPGrzHQCFrBYly1IpjcFxI4zUQ0oLdn7slpXQ4TmVw09fhfIZ-AAjJPmk</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>Fortnow, L.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2001</creationdate><title>Comparing notions of full derandomization</title><author>Fortnow, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i104t-7cd97468831db60abee9491e3669d674c80bb1c3cf870e3fd8741ca4569b80313</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Circuits</topic><topic>Polynomials</topic><toplevel>online_resources</toplevel><creatorcontrib>Fortnow, L.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fortnow, L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Comparing notions of full derandomization</atitle><btitle>Proceedings 16th Annual IEEE Conference on Computational Complexity</btitle><stitle>CCC</stitle><date>2001</date><risdate>2001</risdate><spage>28</spage><epage>34</epage><pages>28-34</pages><isbn>0769510531</isbn><isbn>9780769510538</isbn><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.</abstract><pub>IEEE</pub><doi>10.1109/CCC.2001.933869</doi><tpages>7</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769510531
ispartof Proceedings 16th Annual IEEE Conference on Computational Complexity, 2001, p.28-34
issn
language eng
recordid cdi_ieee_primary_933869
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Circuits
Polynomials
title Comparing notions of full derandomization
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T19%3A45%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Comparing%20notions%20of%20full%20derandomization&rft.btitle=Proceedings%2016th%20Annual%20IEEE%20Conference%20on%20Computational%20Complexity&rft.au=Fortnow,%20L.&rft.date=2001&rft.spage=28&rft.epage=34&rft.pages=28-34&rft.isbn=0769510531&rft.isbn_list=9780769510538&rft_id=info:doi/10.1109/CCC.2001.933869&rft_dat=%3Cieee_6IE%3E933869%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=933869&rfr_iscdi=true