1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Alexander Semenov, Konstantin Chukharev, Egor Tarasov +2
In this paper we investigate how to estimate the hardness of Boolean satisfiability (SAT) encodings for the Logical Equivalence Checking problem (LEC). Meaningful estimates of hard…