Homework 1
Homework 1: Is 2-SAT NP-complete? Given a polynomial algorithm if you think it is not; or prove it is NP-complete by reduction from an NP-complete problem.
posted by Quincy Wu | 10:12 PM
Homework 1: Is 2-SAT NP-complete? Given a polynomial algorithm if you think it is not; or prove it is NP-complete by reduction from an NP-complete problem.
posted by Quincy Wu | 10:12 PM
0 Comments:
Post a Comment
<< Home