More on BPP and the polynomial-time hierarchy (Q1351599)
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: More on BPP and the polynomial-time hierarchy |
scientific article; zbMATH DE number 984450
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More on BPP and the polynomial-time hierarchy |
scientific article; zbMATH DE number 984450 |
Statements
More on BPP and the polynomial-time hierarchy (English)
0 references
27 February 1997
0 references
Theory of computation
0 references
Computational complexity
0 references
Randomness
0 references
Interactive proofs
0 references
0.8673986
0 references
0.8671259
0 references
0.8511689
0 references
0.8510975
0 references
0.84819263
0 references
0.84397453
0 references
0.8375702
0 references
0.8367657
0 references
