A refinement of the low and high hierarchies (Q4841766): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting problems and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with small generalized Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sets, Lowness and Highness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets Truth-Table Reducible to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Relativizations of Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second step toward the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sparse sets and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Circuit-Size Complexity and the Low Hierarchy in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-reducible sets of small density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low and a high hierarchy within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and closeness to complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:53, 23 May 2024

scientific article; zbMATH DE number 778429
Language Label Description Also known as
English
A refinement of the low and high hierarchies
scientific article; zbMATH DE number 778429

    Statements

    A refinement of the low and high hierarchies (English)
    0 references
    0 references
    0 references
    0 references
    24 July 1995
    0 references
    0 references
    polynomial-time hierarchy
    0 references
    sparse sets
    0 references
    extended low hierarchies
    0 references