The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205)

From MaRDI portal
Revision as of 18:12, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references