Close
Register
Close Window

OpenDSA Modules Collection with Slides

Chapter 28 Limits to Computing

Show Source |    | About   «  28.3. NP-Completeness   ::   Contents   ::   28.5. Formula Satisfiability  »

28.4. Circuit Satisfiability

28.4.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.

   «  28.3. NP-Completeness   ::   Contents   ::   28.5. Formula Satisfiability  »

nsf
Close Window