Marc B
Marc B
🙋 About
👷 Experience
📰 Posts
🏗️ Projects
👨🏫 Teaching
📫 Contact
📃 CV
Light
Dark
Automatic
SAT
Design of an environment for solving pseudo-Boolean optimization problems
Bachelor’s thesis Boolean Satisfiability problems (SAT) consists of finding a valid assignment (model) for a set of Boolean variables. It was the first problem proven to be NP-Complete which allowed reducing many NP-Complete problems to it.
PDF
Code
Slides
Cite
×
