Short Proofs in Strong Proof Systems

Short Proofs in Strong Proof Systems

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=TRZ0LIifhi4


Duration: 59:51
651 views
15

Marijn Heule (Carnegie Mellon University)
https://simons.berkeley.edu/talks/tbd-284
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing



Other Videos By Simons Institute for the Theory of Computing


2021-04-08Branching on Formulas: A Perspective From Knowledge Compilation
2021-04-07Finite Model Theory
2021-04-07The Area-Law Conjecture in Many-Body Quantum Physics | Quantum Colloquium
2021-04-07Tutorial Session on Ground States of Local Hamiltonians | Quantum Colloquium
2021-04-06Answer Set Programming in a Nutshell
2021-04-05Counterexample Guided Inference of Modular Specifications
2021-04-05Visualization By Example
2021-04-05Counterexample-guided Repair in Boolean Functional Synthesis
2021-04-05Guarantees in Syntax-Guided Synthesis
2021-04-01SAT for Optimization
2021-04-01Short Proofs in Strong Proof Systems
2021-04-01Back to the Future: A Fresh Look at Linear Temporal Logic
2021-03-31Panel Discussion on Potential for Quantum Advantage in Machine Learning | Quantum Colloquium
2021-03-31On Quantum Linear Algebra for Machine Learning | Quantum Colloquium
2021-03-31Exact Mixed-Integer Programming over the Rational Numbers
2021-03-29On Optimal Collusion-Free Teaching
2021-03-29Towards a Theory of Learning Inductive Invariants
2021-03-29Formal Synthesis: Oracle-guided Learning of Compositional Concepts
2021-03-29Inferring Specifications From Demonstrations; A Maximum (Causal) Entropy Approach
2021-03-26Subgame Perfect Equilibria
2021-03-25Information Efficiency of Proof Systems


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Marijn Heule
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing