On Circuit-Size Complexity and the Low Hierarchy in NP (Q3675520)
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: On Circuit-Size Complexity and the Low Hierarchy in NP |
scientific article; zbMATH DE number 3896300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Circuit-Size Complexity and the Low Hierarchy in NP |
scientific article; zbMATH DE number 3896300 |
Statements
On Circuit-Size Complexity and the Low Hierarchy in NP (English)
0 references
1985
0 references
sparse set
0 references
polynomial size circuits
0 references
p-selective set
0 references
0.9173467
0 references
0.9150522
0 references
0.91342014
0 references
0 references
0.9030194
0 references
0.9029318
0 references
0.8967332
0 references
0.89628994
0 references
