Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Prove that if $P = NP$, then there is an algorithm that can find a boolean assignment for a 3-SAT problem in P time if it exists.

$P = NP$ only says that we can decide whether a 3-SAT problem is satisfiable but it doesn't say anything about how to find a satisfying boolean expression.

Does any one know how to tackle this problem?

share|improve this question
    
This question may be better at cstheory.stackexchange.com –  Kevin Oct 27 '13 at 5:02
    
@Kevin: As csteory.SE is mainly for research-level questions, this question would in all likelihood be closed quite quickly there. This question is also not off-topic here. –  Arthur Fischer Oct 27 '13 at 5:34

1 Answer 1

up vote 4 down vote accepted

Take your formula and check if it is satisfiable. If so, conjoin $x_1$ to your formula, where $x_1$ is your first variable, and check if it is still satisfiable. If so, then there is an assignment where $x_1$ is true; otherwise, there is one where $x_1$ is false.

Conjoin $x_1$ or $\neg x_1$ and repeat for all of the other variables.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.