Bounding queries in the analytic polynomial-time hierarchy (Q1274987): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to: Non-deterministic exponential time has two-prower interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analytic Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank

Latest revision as of 17:00, 28 May 2024

scientific article
Language Label Description Also known as
English
Bounding queries in the analytic polynomial-time hierarchy
scientific article

    Statements

    Bounding queries in the analytic polynomial-time hierarchy (English)
    0 references
    0 references
    0 references
    12 January 1999
    0 references
    complexity theory
    0 references
    quantifiers
    0 references
    operators
    0 references
    oracles
    0 references
    bounding queries
    0 references
    polynomial-time hierarchies
    0 references

    Identifiers