原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
in Figure 34.8(b) to produce a 1 output. Since it always produces 0, it is unsatisfiable.
The circuit-satisfiability problem is, “Given a boolean combinational circuit composed of AND, OR, and NOT gates, is it satisfiable?” In order to pose this question formally, however, we must agree on a standard encoding for circuits. The size of a boolean combinational circuit is the number of boolean combinational elements plus the number of wires in the circuit. We could devise a graph-like encoding that maps any given circuit C into a binary string 〈C〉 whose length is polynomial in the size of the circuit itself. As a formal language, we can therefore define CIRCUIT-SAT = {〈C〉 : C is a satisfiable boolean combinational circuit}. The circuit-satisfiability problem arises in the area of computer-aided hardware optimization. If a subcircuit always produces 0, that
subcircuit is unnecessary: the designer can replace it by a simpler subcircuit that omits
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea