6.5. Circuit Satisfiability¶
6.5.1. Circuit Satisfiability¶
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.
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.
Contact Us || Privacy | | License « 6.4. NP-Completeness Proofs :: Contents :: 6.6. Formula Satisfiability »
