Show Source | | About « 8.4. NP-Completeness Proofs :: Contents :: 8.6. Formula Satisfiability »
In the above problem, given a particular assignment, while we can quickly check whether the assignment satisfies the circuit or not, we have no easy way of knowing whether it has any satisfying assignment.
Contact Us || Privacy | | License « 8.4. NP-Completeness Proofs :: Contents :: 8.6. Formula Satisfiability »