New answers tagged

1 vote
Accepted

Proving 2SAT is in P vs algorithm for finding a satisfying assignment

You don't need the corollary in order to show that 2SAT is in P. Rather, it uses the same techniques to give a fast algorithm for finding a satisfying assignment for satisfiable 2CNFs. If you're not ...
user avatar

Top 50 recent answers are included