Develop a representation for SAT problems that uses a 2D array of integers. Use +1, -1, and 0 in the way we used "+", "-", and ".", respectively, in the String array representation we used in the text. Prove that SAT is in NP by developing a polynomial-time check() method for your representation.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here