On derandomizing algorithms that err extremely rarely (Q5259544)
From MaRDI portal
scientific article; zbMATH DE number 6451538
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On derandomizing algorithms that err extremely rarely |
scientific article; zbMATH DE number 6451538 |
Statements
On derandomizing algorithms that err extremely rarely (English)
0 references
26 June 2015
0 references
Hastad's switching lemma
0 references
approximate counting
0 references
derandomization
0 references
log-space
0 references
pseudorandom generators
0 references
