- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Inductive Time-Space Lower Bounds for Sat and Related Problems ; volume:15 ; number:4 ; pages:433-470 ; date:12.2006
Computational complexity ; 15, Heft 4, 433-470, 12.2006
- Urheber
-
Williams, Ryan
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-007-0221-1
- URN
-
urn:nbn:de:101:1-2021080922065236871439
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:02 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
- Williams, Ryan
- SpringerLink (Online service)
Ähnliche Objekte (12)
Space Lower Bounds for the Signal Detection Problem
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
Proportionality’s Lower Bound
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
Treewidth Lower Bounds with Brambles
'Change in space’-point estimation, Part I: Lower bound for rates of consistency
Space Lower Bounds for the Signal Detection Problem
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
Proportionality’s Lower Bound
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
Treewidth Lower Bounds with Brambles
'Change in space’-point estimation, Part I: Lower bound for rates of consistency
Space Lower Bounds for the Signal Detection Problem
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
Proportionality’s Lower Bound
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
Treewidth Lower Bounds with Brambles