THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS (Q5462667): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Bernd Borchert / rank
Normal rank
 
Property / author
 
Property / author: Klaus-Joern Lange / rank
Normal rank
 
Property / author
 
Property / author: Frank Stephan / rank
Normal rank
 
Property / author
 
Property / author: Bernd Borchert / rank
 
Normal rank
Property / author
 
Property / author: Klaus-Joern Lange / 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 / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Existentially First-Order Definable Languages and Their Relation to NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the leaf language classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to define complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized polynomial hierarchies extending two levels / 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: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally trivial categories and unambiguous concatenation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure and unambiguous product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le produit de concatenation non ambigu / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages defined by generalized first-order formulas with a bounded number of bound variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank

Latest revision as of 13:35, 10 June 2024

scientific article; zbMATH DE number 2190865
Language Label Description Also known as
English
THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS
scientific article; zbMATH DE number 2190865

    Statements

    Identifiers