28.4. Circuit Satisfiability¶
28.4.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 « 28.3. NP-Completeness :: Contents :: 28.5. Formula Satisfiability »
