zweidimensionales bewegtes Bild
Proof complexity of Satisfiability Modulo Theories
- Alternative title
-
The Proof Complexity of SMT Solvers
- Location
-
Hannover TIB
- Extent
-
113MB, 00:32:39:28 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
Theory and Practice of Satisfiability Solving (18w5208) ; (Jan. 2018)
- Event
-
Veröffentlichung
- (who)
-
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
- (when)
-
2018-01-01
- Contributor
-
Kolokolova, Antonina
Robere, Robert
Ganesh, Vijay
- DOI
-
10.5446/59385
- Last update
-
04.12.2024, 8:09 AM CET
Data provider
This object is provided by:
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Object type
- zweidimensionales bewegtes Bild
Associated
- Kolokolova, Antonina
- Robere, Robert
- Ganesh, Vijay
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Time of origin
- 2018-01-01
Other Objects (12)
Interpolation modulo theories
Optimal planning modulo theories
Proof Complexity 2020
Proof Complexity of Quantified Boolean Formulas
Lifting Applied to Proof Complexity
Proof Complexity for SAT practitioner
The complexity of finite variable theories
The computational complexity of logical theories
Non-classical aspects in proof complexity
A Proof Complexity View of Pseudo-Boolean Solving
Why are Proof Complexity Lower Bounds Hard?
Complexity of Constraint Satisfaction Problems for Unions of Theories
Interpolation modulo theories
Optimal planning modulo theories
Proof Complexity 2020
Proof Complexity of Quantified Boolean Formulas
Lifting Applied to Proof Complexity
Proof Complexity for SAT practitioner
The complexity of finite variable theories
The computational complexity of logical theories
Non-classical aspects in proof complexity
A Proof Complexity View of Pseudo-Boolean Solving
Why are Proof Complexity Lower Bounds Hard?
Complexity of Constraint Satisfaction Problems for Unions of Theories
Interpolation modulo theories
Optimal planning modulo theories
Proof Complexity 2020
Proof Complexity of Quantified Boolean Formulas
Lifting Applied to Proof Complexity
Proof Complexity for SAT practitioner
The complexity of finite variable theories
The computational complexity of logical theories
Non-classical aspects in proof complexity
A Proof Complexity View of Pseudo-Boolean Solving
Why are Proof Complexity Lower Bounds Hard?