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
Natural Language ProcessingColumbia University via Coursera Intro to Algorithms
Udacity Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Paradigms of Computer Programming
Université catholique de Louvain via edX Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX