A decisive characterization of BPP (Q4725751)
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: Publication:4725751 |
scientific article; zbMATH DE number 3999296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A decisive characterization of BPP |
scientific article; zbMATH DE number 3999296 |
Statements
A decisive characterization of BPP (English)
0 references
1986
0 references
probabilistic algorithms
0 references
random oracle
0 references
Turing machines
0 references
complexity class BPP
0 references
polynomial-time predicate
0 references
random quantifier
0 references
probabilistic classes
0 references
0.8397717475891113
0 references
0.8364606499671936
0 references
0.8285913467407227
0 references
