YoVDO

SAT-Solving

Offered By: Simons Institute via YouTube

Tags

Algorithms Courses Algorithm Design Courses Theoretical Computer Science Courses Logical Reasoning Courses

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

Pensamiento algorítmico
Tecnológico de Monterrey via Coursera
离散数学概论 Discrete Mathematics Generality
Peking University via Coursera
Cómo resolver problemas y tomar decisiones con eficacia
University of California, Irvine via Coursera
Wissenschaftliches Denken, Arbeiten und Schreiben
Fachhochschule Münster via iversity
Mathematical Logic and Algorithms Theory
Tomsk State University of Control Systems and Radioelectronics via iversity