Search result for Sat solvers Online Courses & Certifications
Get Course Alerts by Email
NP-Complete Problems
by Daniel Kane , Alexander S. Kulikov- 0.0
3 Weeks
Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques. Step into the area of more complex problems and learn advanced algorithms to help solve them. You will practice solving large instances of some of these problems despite their hardness using very efficient specialized software and algorithmic techniques including:...
$150
Automated Reasoning: satisfiability
by Hans Zantema- 4.8
Approx. 25 hours to complete
SAT/SMT basics, SAT examples Introduction to SAT Theory and algorithms for CNF-based SAT...
Advanced Algorithms and Complexity
by Alexander S. Kulikov , Michael Levin , Daniel M Kane , Neil Rhodes- 4.6
Approx. 27 hours to complete
SAT to 3-SAT Circuit SAT to SAT All of NP to Circuit SAT...