Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ (Q4717047): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W2403318995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with small generalized Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic advice classes / 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: Bounded queries to SAT and the Boolean hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751004 / 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: The difference and truth-table hierarchies for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for 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: Q4942618 / 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: Complexity and structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: RelativizedNC / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decomposability of $NC$ and $AC$ / rank
 
Normal rank

Latest revision as of 15:59, 24 May 2024

scientific article; zbMATH DE number 951902
Language Label Description Also known as
English
Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
scientific article; zbMATH DE number 951902

    Statements

    Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ (English)
    0 references
    0 references
    0 references
    13 April 1997
    0 references
    0 references
    complexity classes
    0 references
    binary search classes
    0 references
    0 references