Satisfiability Problem

Concept

A fundamental problem in propositional logic where one determines if there exists an assignment of truth values to variables that makes a given Boolean formula true, proven to be NP-complete by Stephen Cook.

Mentioned in 1 video

Videos Mentioning Satisfiability Problem

Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111

Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111

Lex Fridman

A fundamental problem in propositional logic where one determines if there exists an assignment of truth values to variables that makes a given Boolean formula true, proven to be NP-complete by Stephen Cook.