SAT-Solving
Offered By: Simons Institute via YouTube
Course Description
Overview
Dive into an extensive 4-hour lecture on SAT-Solving presented by Armin Biere from Johannes Kepler University as part of the Satisfiability: Theory, Practice, and Beyond Boot Camp at the Simons Institute. Explore the fundamental concepts, practical applications, and advanced techniques in Boolean satisfiability problem solving, gaining insights into this crucial area of computational logic and its implications for various fields in computer science and mathematics.
Syllabus
SAT-Solving
Taught by
Simons Institute
Related Courses
Automata TheoryStanford University via edX Intro to Theoretical Computer Science
Udacity Computing: Art, Magic, Science
ETH Zurich via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera