Show Source | | About « 0.209. NP-Completeness :: Contents :: 0.211. 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 « 0.209. NP-Completeness :: Contents :: 0.211. Formula Satisfiability »