3 papers
cs.LO2025
Simplifier: A New Tool for Boolean Circuit Simplification
Daniil Averkov, Gregory Emdin, Viktoriia Krivogornitsyna +4
The Boolean circuit simplification problem involves finding a smaller circuit that computes the same function as a given Boolean circuit. This problem is closely related to several…
cs.LO2024
Cirbo: A New Tool for Boolean Circuit Analysis and Synthesis
Daniil Averkov, Tatiana Belova, Gregory Emdin +8
We present an open-source tool for manipulating Boolean circuits. It implements efficient algorithms, both existing and novel, for a rich variety of frequently used circuit tasks s…
cs.CC2022
CNF Encodings of Parity
Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin +1
The minimum number of clauses in a CNF representation of the parity function is . One can obtain a more compact CNF encoding by u…