Time-space lower bounds for the polynomial-time hierarchy on randomized machines
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Ausgabe
-
Preliminary version
- Sprache
-
Englisch
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
[Wadern]
- (wer)
-
[Internat. Begegnungs- und Forschungszentrum für Informatik]
- (wann)
-
[2006]
- Beteiligte Personen und Organisationen
-
Diehl, Scott
van Melkebeek, Dieter
- URN
-
urn:nbn:de:0030-drops-6054
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:46 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
- Diehl, Scott
- van Melkebeek, Dieter
- [Internat. Begegnungs- und Forschungszentrum für Informatik]
Entstanden
- [2006]
Ähnliche Objekte (12)
A hierarchy of polynomial time lattice basis reduction algorithms
On membership problems solvable by turing machines within polynomial time
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Polynomial time calculi
Time machines
On average polynomial time
Polynomial time partial information classes
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Complexity of turing machine computations, Course unit 5.. INP complete problems and the polynomial time hierarchy
Type systems for polynomial time computation
Finding Cactus Roots in Polynomial Time
A hierarchy of polynomial time lattice basis reduction algorithms
On membership problems solvable by turing machines within polynomial time
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Polynomial time calculi
Time machines
On average polynomial time
Polynomial time partial information classes
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Complexity of turing machine computations, Course unit 5.. INP complete problems and the polynomial time hierarchy
Type systems for polynomial time computation
Finding Cactus Roots in Polynomial Time
A hierarchy of polynomial time lattice basis reduction algorithms
On membership problems solvable by turing machines within polynomial time
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Polynomial time calculi
Time machines
On average polynomial time
Polynomial time partial information classes
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Complexity of turing machine computations, Course unit 5.. INP complete problems and the polynomial time hierarchy
Type systems for polynomial time computation