Can every randomized algorithm be derandomized? | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Impagliazzo06>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Russell_Impagliazzo>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1145%2F1132516.1132571>
foaf:homepage	<https://doi.org/10.1145/1132516.1132571>
dc:identifier	DBLP conf/stoc/Impagliazzo06 (xsd:string)
dc:identifier	DOI doi.org%2F10.1145%2F1132516.1132571 (xsd:string)
dcterms:issued	2006 (xsd:gYear)
rdfs:label	Can every randomized algorithm be derandomized? (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Russell_Impagliazzo>
swrc:pages	373-374 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/stoc/2006>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/stoc/Impagliazzo06/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/stoc/Impagliazzo06>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/stoc/stoc2006.html#Impagliazzo06>
rdfs:seeAlso	<https://doi.org/10.1145/1132516.1132571>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/stoc>
dc:subject	algebraic circuit complexity, circuit complexity, complexity classes, derandomization, probabilistic algorithms, pseudo-randomness (xsd:string)
dc:title	Can every randomized algorithm be derandomized? (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document