Close
Register
Close Window

FSC CSC 3380 Analysis of Algorithms

Chapter 14 Limits to Computing

Show Source |    | About   «  14.3. NP-Completeness   ::   Contents   ::   14.5. Formula Satisfiability  »

14.4. Circuit Satisfiability

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

   «  14.3. NP-Completeness   ::   Contents   ::   14.5. Formula Satisfiability  »

nsf
Close Window