3 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.LO2018
Revisiting Decision Diagrams for SAT
Tom van Dijk, Rüdiger Ehlers, Armin Biere
Symbolic variants of clause distribution using decision diagrams to eliminate variables in SAT were shown to perform well on hard combinatorial instances. In this paper we revisit…
cs.LO2017★ 3 cited
Blocked Clauses in First-Order Logic
Benjamin Kiesl, Martin Suda, Martina Seidl +2
Blocked clauses provide the basis for powerful reasoning techniques used in SAT, QBF, and DQBF solving. Their definition, which relies on a simple syntactic criterion, guarantees t…
cs.IT2007★ 1 cited
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
Marius Zimand
The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequen…