A Boolean circuit is a finite directed acyclic graph of Boolean gates with designated inputs and outputs.
The circuit satisfiability problem asks whether a Boolean circuit has an input on which its designated output is one. It is NP-complete.
Articles by others on the same topic
A **Boolean circuit** is a mathematical model used in computer science and electrical engineering to represent Boolean functions via a network of interconnected logical gates. Boolean circuits are foundational in the fields of digital logic design, computation theory, and complexity theory. ### Components of a Boolean Circuit: 1. **Variables**: These represent the inputs to the circuit, which can take on values of either true (1) or false (0).