The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: William I. Gasarch / rank
 
Normal rank
Property / author
 
Property / author: Martin Kummer / rank
 
Normal rank
Property / author
 
Property / author: Georgia A. Martin / rank
 
Normal rank
Property / author
 
Property / author: Frank Stephan / 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.2307/2586523 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2575237024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way functions and pseudorandom generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Degrees of Hyperimmune Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative counting is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded query classes and the difference hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terse, superterse, and verbose sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical foundations of computer science 1996. 21st international symposium, MFCS '96, Cracow, Poland, September 2--6, 1996. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency computation and bounded queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex subsets of \(2^n\) and bounded truth-table reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded queries in recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Search Problems / rank
 
Normal rank

Latest revision as of 14:58, 29 May 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
    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
    0 references