The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2586523 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2575237024 / rank | |||
Normal rank | |||
Revision as of 00:36, 20 March 2024
scientific article; zbMATH DE number 1444037
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> |
scientific article; zbMATH DE number 1444037 |
Statements
The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (English)
0 references
22 June 2000
0 references
bounded query reduction
0 references
query hierarchy
0 references
frequency computation
0 references
recursively enumerable set
0 references
semirecursive set
0 references
jump
0 references
