Hard Formulas in Proof Complexity by Composition

Channel:

Subscribers:

68,700

Published on May 20, 2021 4:20:08 AM ● Video Link: https://www.youtube.com/watch?v=9pXul19UujQ

Duration: 37:34

223 views

Robert Robere (McGill University)
https://simons.berkeley.edu/talks/proof-complexity-toolbox
Theoretical Foundations of SAT/SMT Solving

Other Videos By Simons Institute for the Theory of Computing

2021-05-21	Conflict-Driven First-Order Decision Procedures
2021-05-21	Solving String Constraints, Starting From the Beginning and From the End
2021-05-20	Look-ahead SAT Solvers: Smart vs. Fast
2021-05-20	Pseudo-Boolean Solving: In Between SAT and ILP
2021-05-20	Searching Inside the Box: A Continuous-Local-Search Approach for Hybrid SAT Solving
2021-05-20	Towards a Complexity-theoretic Understanding of Restarts in SAT solvers
2021-05-20	Using Resolution and Cutting Planes for Verification of Nonlinear Bit-Vector Properties
2021-05-20	The Proof Complexity of Integer Programming
2021-05-20	Hard Examples for Common Variable Decision Heuristics
2021-05-19	Non-Automatability: When Finding Proofs Is Provably Hard
2021-05-19	Hard Formulas in Proof Complexity by Composition
2021-05-19	Proof Complexity meets Finite Model Theory
2021-05-18	Encodings and Consistency from a Constraint Programming Perspective
2021-05-18	Advantages and limitations of Dual-Rail MaxSAT
2021-05-18	Representing problems to SAT solvers: basic theory, basic questions
2021-05-17	Structural Parameters - Heterogeneity and Geometry
2021-05-17	Algorithmic utilization of structure in SAT instances
2021-05-17	On the Formal Characterization of Industrial SAT Instances
2021-05-16	On Using Structural Properties to Improve CDCL Solver Performance
2021-05-16	Towards an (Experimental) Understanding of SAT Solvers
2021-05-16	Perspectives on Practice and Theory of SAT Solving

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Theoretical Foundations of SAT/SMT Solving

Robert Robere