Theory of Algorithms

Chapter 9 Limits to Computing

| About   中文版   «  9.4. NP-Completeness Proofs   ::   Contents   ::   9.6. Formula Satisfiability  »

9.5. Circuit Satisfiability

9.5.1. Circuit Satisfiability

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

While it is easy to check whether a given truth assignment satisfies a given circuit, we have no easy way of knowing whether an arbitrary cirucit has some satisfying assignment.

   «  9.4. NP-Completeness Proofs   ::   Contents   ::   9.6. Formula Satisfiability  »

Close Window