The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205)
From MaRDI portal
!
WARNING
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 1444037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7773849964141846
0 references
0.7773596048355103
0 references
