- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Williams, Ryan
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-007-0221-1
- URN
-
urn:nbn:de:101:1-2021080922065236871439
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:02 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Williams, Ryan
- SpringerLink (Online service)
Other Objects (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
Treewidth Lower Bounds with Brambles
Lower Bounds for Heuristic Algorithms
'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
Treewidth Lower Bounds with Brambles
Lower Bounds for Heuristic Algorithms
'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
Treewidth Lower Bounds with Brambles
Lower Bounds for Heuristic Algorithms