- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
WSI-Reports - Schriftenreihe des Wilhelm-Schickard-Instituts für Informatik ; 2004, 3
- Klassifikation
-
Informatik
- Schlagwort
-
Komplexitätsklasse ; Dot-Depth-Hierarchie ; Straubing-Thérien-Hierarchie ; Komplexitätsklasse NP
- Ereignis
-
Veröffentlichung
- (wo)
-
Tübingen
- (wer)
-
Universitätsbibliothek Tübingen
- (wann)
-
2004
- Urheber
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:bsz:21-opus-12234
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:24 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Borchert, Bernd
- Lange, Klaus-Jörn
- Stephan, Frank
- Tesson, Pascal
- Therien, Denis
- Wilhelm-Schickard-Institut für Informatik. Arbeitsbereich Theoretische Informatik, Formale Sprachen, Tübingen
- Universitätsbibliothek Tübingen
Entstanden
- 2004
Ähnliche Objekte (12)
The dot-depth hierarchy versus iterated block products of DA
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
New Classes of Complete Problems for the Second Level of the Polynomial Hierarchy
Around dot-depth one
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Placing problems from phylogenetics and (quantified) propositional logic in the polynomial hierarchy
A hierarchy of polynomial time lattice basis reduction algorithms
Polynomial Identity Testing for Small Depth Circuits
Polynomial Identity Testing for Depth 3 Circuits
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
The Penrose polynomial
The dot-depth hierarchy versus iterated block products of DA
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
New Classes of Complete Problems for the Second Level of the Polynomial Hierarchy
Around dot-depth one
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Placing problems from phylogenetics and (quantified) propositional logic in the polynomial hierarchy
A hierarchy of polynomial time lattice basis reduction algorithms
Polynomial Identity Testing for Small Depth Circuits
Polynomial Identity Testing for Depth 3 Circuits
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
The Penrose polynomial
The dot-depth hierarchy versus iterated block products of DA
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
New Classes of Complete Problems for the Second Level of the Polynomial Hierarchy
Around dot-depth one
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Placing problems from phylogenetics and (quantified) propositional logic in the polynomial hierarchy
A hierarchy of polynomial time lattice basis reduction algorithms
Polynomial Identity Testing for Small Depth Circuits
Polynomial Identity Testing for Depth 3 Circuits
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere