What is the complexity for converting any propositional formula to CNF format? Is it an NP-complete problem?
What is the complexity for converting any propositional formula to CNF format? Is it
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What is the complexity for converting any propositional formula to CNF format? Is it an NP-complete problem?
The standard algorithm to transform a general Well-Formed Formula to an equivalent CNF has an exponential run time, since in the worst case a n-clauses WFF is equivalento to a 2^n-clauses CNF.
However, you can transform in polynomial time an arbitrary boolean formula into a CNF that is not stricty equivalent, but satisfable only if the boolean formula is satisfable. This is the standard reduction used to prove that 3CNF is NP-complete, givent that the more general SAT is NP-complete. See here.