RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS (Q4315092)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 699547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS |
scientific article; zbMATH DE number 699547 |
Statements
RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS (English)
0 references
6 December 1994
0 references
complexity classes
0 references
Boolean decision trees
0 references
0.90785533
0 references
0.90536475
0 references
0.8937056
0 references
0.8889593
0 references
0.88767534
0 references
0.8841759
0 references
0.8838126
0 references
0.8838053
0 references
