Login / Signup
Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits.
Alexander A. Semenov
Konstantin Chukharev
Egor Tarasov
Daniil Chivilikhin
Viktor Kondratiev
Published in:
CoRR (2022)
Keyphrases
</>
sat encodings
logical equivalence
np complete
computational complexity
sat solvers
data exchange
np hard
constraint satisfaction problems
boolean functions
combinatorial problems
default theories
special case
phase transition
consistency checking
graph coloring