On Circuit-Size Complexity and the Low Hierarchy in NP (Q3675520): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Ker-I. Ko / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Uwe Schoening / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0214003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999609654 / rank | |||
Normal rank | |||
Latest revision as of 14:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Circuit-Size Complexity and the Low Hierarchy in NP |
scientific article |
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
