46 citations · 48 across the 4 of their papers we have counts for
1 paper · 1 filter
Daniil Chivilikhin, Artem Pavlenko, Alexander Semenov
In the article, within the framework of the Boolean Satisfiability problem (SAT), the problem of estimating the hardness of specific Boolean formulas w.r.t. a specific complete SAT…