Can every randomized algorithm be derandomized? (Q2931400)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Can every randomized algorithm be derandomized? |
scientific article; zbMATH DE number 6373909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Can every randomized algorithm be derandomized? |
scientific article; zbMATH DE number 6373909 |
Statements
Can every randomized algorithm be derandomized? (English)
0 references
25 November 2014
0 references
algebraic circuit complexity
0 references
circuit complexity
0 references
complexity classes
0 references
derandomization
0 references
probabilistic algorithms
0 references
pseudo-randomness
0 references
0.8418960571289062
0 references
0.8285976052284241
0 references
