- Weitere Titel
-
Introduction to Proof Complexity for SAT practitioner
- Sprache
-
Englisch
- Umfang
-
223MB, 01:03:10:01 (unknown)
- Anmerkungen
-
Audiovisuelles Material
- Standort
-
Hannover TIB
- Erschienen in
-
Theory and Practice of Satisfiability Solving (18w5208) ; (Jan. 2018)
- Beteiligte Personen und Organisationen
-
Lauria, Massimo
- Ereignis
-
Veröffentlichung
- (wer)
-
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
- (wann)
-
2018-01-01
- DOI
-
10.5446/59365
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Lauria, Massimo
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Entstanden
- 2018-01-01
Ähnliche Objekte (12)
Proof Complexity 2020
Lifting Applied to Proof Complexity
Non-classical aspects in proof complexity
Proof Complexity of Quantified Boolean Formulas
Proof complexity of Satisfiability Modulo Theories
Why are Proof Complexity Lower Bounds Hard?
A Proof Complexity View of Pseudo-Boolean Solving
A Finite-Model-Theoretic View on Propositional Proof Complexity
Practitioner track
Practitioner’s Corner
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
Proof Complexity 2020
Lifting Applied to Proof Complexity
Non-classical aspects in proof complexity
Proof Complexity of Quantified Boolean Formulas
Proof complexity of Satisfiability Modulo Theories
Why are Proof Complexity Lower Bounds Hard?
A Proof Complexity View of Pseudo-Boolean Solving
A Finite-Model-Theoretic View on Propositional Proof Complexity
Practitioner track
Practitioner’s Corner
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
Proof Complexity 2020
Lifting Applied to Proof Complexity
Non-classical aspects in proof complexity
Proof Complexity of Quantified Boolean Formulas
Proof complexity of Satisfiability Modulo Theories
Why are Proof Complexity Lower Bounds Hard?
A Proof Complexity View of Pseudo-Boolean Solving
A Finite-Model-Theoretic View on Propositional Proof Complexity
Practitioner track
Practitioner’s Corner
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity