Tseytin transformation

Today it means: A transformation that, given an arbitrary combinatorial logic circuit, produces an equisatisfiable Boolean formula in conjunctive normal form, the length of the formula being linear in the size of the circuit. Full definition →