Description:
- Similar to Boolean Stisfiability Problem
- A circuit K is a labelled, directed acyclic graph such that
- the sources in K are labelled with constants (0 or 1) or the name of a distinct variable (the inputs to the circuit).
- every other node is labelled with one Boolean operator AND, OR, and NOT
- a single node with no outgoing edges represents the output of K