1:59:34Alexander Nadel: SAT solving and beyond: A fresh intro and recent developments
Advanced
A 120-minute video from MIAO Research: “Alexander Nadel: SAT solving and beyond: A fresh intro and recent developments”.
450 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
1:59:34Advanced
A 120-minute video from MIAO Research: “Alexander Nadel: SAT solving and beyond: A fresh intro and recent developments”.
2:02:11Advanced
A 122-minute video from MIAO Research: “Alexander Tesch: Current developments in pseudo-Boolean optimization”.
54:31Advanced
A 55-minute video from MIAO Research: “Alexandros Hollender: Approximately optimal Fisher markets and the need for a PCP theorem for PPAD”.
1:42:14Advanced
A 102-minute video from MIAO Research: “Anastasia Sofronova: Lower bounds beyond DNF of parities”.
2:03:13Advanced
A 123-minute video from MIAO Research: “Andy Oertel: Certifying combinatorial optimization: A unified approach with pseudo-Boolean reasoning”.
1:00:00Advanced
A 60-minute video from MIAO Research: “Antonina Kolokolova: Learning from proofs”.
1:43:16Advanced
A 103-minute video from MIAO Research: “Artur Riazanov: The generalised Linial-Nisan conjecture is false for DNFs”.
1:44:23Advanced
A 104-minute video from MIAO Research: “Bruno Pasqualotto Cavalar: Monotone circuit complexity of matching”.
1:52:01Advanced
A 112-minute video from MIAO Research: “Christopher Hojny: A proof system for certifying symmetry and optimality in integer programming”.
55:30Advanced
A 56-minute video from MIAO Research: “Deniz Imrek: Separations above TFNP from Sherali-Adams lower bounds”.
55:01Advanced
A 55-minute video from MIAO Research: “Dmitriy Traytel: Certified runtime monitoring”.
1:40:41Advanced
A 101-minute video from MIAO Research: “Dmitry Sokolov: Searching for falsified clause in random CNFs is hard for randomized communication”.
1:57:44Advanced
A 118-minute video from MIAO Research: “Duri A Janett: Truly supercritical trade-offs for resolution, cutting planes, monotone circuits, ...”.
2:00:55Advanced
A 121-minute video from MIAO Research: “George Katsirelos: Relating IHS and core-guided MaxSAT solvers via linear programming”.
1:55:47Advanced
A 116-minute video from MIAO Research: “Haniel Barbosa: SMT proof production, checking and reconstruction”.
1:51:03A 111-minute video from MIAO Research: “Ian Mertz: Catalytic computing: A primer”.
1:34:24Advanced
A 94-minute video from MIAO Research: “Jeremias Berg: Solving optimization problems by a sequence of decisions”.
1:59:51Advanced
A 120-minute video from MIAO Research: “Kilian Risse: Supercritical tradeoffs for monotone circuits”.
1:30:07Advanced
A 90-minute video from MIAO Research: “Leroy Chew: Quantified Boolean formulas, proof and strategy extraction”.
1:43:13Advanced
A 103-minute video from MIAO Research: “Marc Vinyals: Lifting with colourful sunflowers”.
1:41:46Advanced
A 102-minute video from MIAO Research: “Markus Anders: Efficient algorithms for symmetry detection”.
2:03:05Advanced
A 123-minute video from MIAO Research: “Matthew McIlree: Certifying the output of constraint programming solvers using proof logging”.
1:49:58Advanced
A 110-minute video from MIAO Research: “Michael Whitmeyer: Communication complexity of collision-finding and bit pigeonhole principle”.
1:03:23Advanced
A 63-minute video from MIAO Research: “Morgan Shirley: Large corner-free sets in high dimensions”.
1:54:44Advanced
A 115-minute video from MIAO Research: “Noah Fleming: PPP is not Turing-closed in the black-box setting”.
1:49:22Advanced
A 109-minute video from MIAO Research: “Noah Fleming: Proofs and search problems”.
1:01:57Advanced
A 62-minute video from MIAO Research: “Oberwolfach '24: Certifying Combinatorial Solving Using Cutting Planes (Jakob Nordström)”.
1:41:06Advanced
A 101-minute video from MIAO Research: “Or Meir: Toward better depth lower bounds: A KRW-like theorem for strong composition”.
1:10:35Advanced
A 71-minute video from MIAO Research: “Paul Beame: Extending CDCL to disjunctions of parity equations”.
2:34:25Advanced
A 154-minute video from MIAO Research: “Proof complexity as a computational lens lecture 10: Proof of general method for degree lower bounds”.
2:30:02Advanced
A 150-minute video from MIAO Research: “Proof complexity as a computational lens lecture 11: Polynomial calculus and graph colouring”.
2:05:30Advanced
A 126-minute video from MIAO Research: “Proof complexity as a computational lens lecture 12: Tightness of size-width/degree relations”.
2:10:37Advanced
A 131-minute video from MIAO Research: “Proof complexity as a computational lens lecture 13: Space complexity; resolution space vs. width”.
2:26:01Advanced
A 146-minute video from MIAO Research: “Proof complexity as a computational lens lecture 14: Space-width separation & size-space trade-offs”.
2:21:40Advanced
A 142-minute video from MIAO Research: “Proof complexity as a computational lens lecture 15: Supercritical size-space trade-offs”.
2:33:39Advanced
A 154-minute video from MIAO Research: “Proof complexity as a computational lens lecture 16: PCR space lower bounds for random CNF formulas”.