Close
Register
Close Window

Senior Algorithms

Chapter 8 Limits to Computing

Show Source |    | About   «  8.4. NP-Completeness Proofs   ::   Contents   ::   8.6. Formula Satisfiability  »

8.5. Circuit Satisfiability

8.5.1. Circuit Satisfiability

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

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.

   «  8.4. NP-Completeness Proofs   ::   Contents   ::   8.6. Formula Satisfiability  »

nsf
Close Window