Characterizations of some complexity classes between Θ2p and Δ2p (Q5096790): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounded queries to SAT and the Boolean hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / 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: Self-reducible sets of small density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703297 / 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 21:43, 29 July 2024

scientific article; zbMATH DE number 7573039
Language Label Description Also known as
English
Characterizations of some complexity classes between Θ2p and Δ2p
scientific article; zbMATH DE number 7573039

    Statements

    Identifiers