The Multilinear Polytope for Acyclic Hypergraphs

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


Duration: 2:07:55
411 views
17

Aida Khajavirad (Lehigh University)
https://simons.berkeley.edu/talks/tbd-301
Beyond Satisfiability



Other Videos By Simons Institute for the Theory of Computing


2021-05-14A Negotiation Procedure for Distributed Reactive Synthesis
2021-05-14Theoretically Speaking — A Panel Discussion on the Film Coded Bias
2021-05-13On Time, and Space, and Width, and Depth
2021-05-13A Personal History of Practical SAT Solving
2021-05-12Constrained Gradient Descent Algorithm for Testing Neural Networks
2021-05-12DL2: Training and Querying Neural Networks with Logic
2021-05-12Training Neural Networks with a Little Help from Knowledge
2021-05-12Unifying Logical and Statistical AI with Markov Logic
2021-05-12Panel Discussion on Quantum Algorithms for Optimization | Quantum Colloquium
2021-05-12Quantum Algorithms for Optimization | Quantum Colloquium
2021-05-11The Multilinear Polytope for Acyclic Hypergraphs
2021-05-10Panel Discussion on Challenges and Opportunities in Synthesis
2021-05-07Formal Languages and Automata for Reward Function Specification and Efficient Reinforcement Learning
2021-05-07Avenir: Managing Data Plane Diversity via Control Plane Synthesis
2021-05-06Cooperative Competition: A New Way of Solving SAT and other NP-Hard Problems in AI and Beyond
2021-05-06Using Program Synthesis to Build Compilers
2021-05-05Preprocessing SAT, MaxSAT, and QBF 3
2021-05-05Preprocessing SAT, MaxSAT, and QBF 2
2021-05-05Preprocessing SAT, MaxSAT, and QBF 1
2021-05-05Panel Discussion on The Role of Proofs in MIP* = RE | Quantum Colloquium
2021-05-05The Role of Proofs in MIP* = RE | Quantum Colloquium


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Aida Khajavirad
Beyond Satisfiability