Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Emdin, Gregory"'
Autor:
Averkov, Daniil, Belova, Tatiana, Emdin, Gregory, Goncharov, Mikhail, Krivogornitsyna, Viktoriia, Kulikov, Alexander S., Kurmazov, Fedor, Levtsov, Daniil, Levtsov, Georgie, Vaskin, Vsevolod, Vorobiev, Aleksey
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 such as satisfiability, synthesis, and minimization. We tested the tool
Externí odkaz:
http://arxiv.org/abs/2412.14933
The minimum number of clauses in a CNF representation of the parity function $x_1 \oplus x_2 \oplus \dotsb \oplus x_n$ is $2^{n-1}$. One can obtain a more compact CNF encoding by using non-deterministic variables (also known as guess or auxiliary var
Externí odkaz:
http://arxiv.org/abs/2203.01082
Autor:
Emdin, Gregory1 (AUTHOR) egd03072000@gmail.com, Kulikov, Alexander S.2 (AUTHOR), Mihajlin, Ivan2 (AUTHOR), Slezkin, Nikita2 (AUTHOR)
Publikováno v:
Theory of Computing Systems. Oct2024, Vol. 68 Issue 5, p1291-1311. 21p.
