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!
Beschreibung
Zusammenfassung: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:10.1109/CCC.2001.933869