tseytin transformation
/T S EH1 T AH0 N T R AE0 N S F ER0 M EY0 SH AH0 N/noun
- 1
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.
Translate “tseytin transformation” into another language
Choose a language below to open the translator with English selected as the source language.