The 2-SAT Problem

From the course by Stanford University
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
454 ratings
Stanford University
454 ratings
Course 4 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Computer Science

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.