8 citations · 12 across the 5 of their papers we have counts for
7 papers
Towards an Understanding of Long-Tailed Runtimes of SLS Algorithms
Jan-Hendrik Lorenz, Florian Wörz
The satisfiability problem is one of the most famous problems in computer science. Its NP-completeness has been used to argue that SAT is intractable. However, there have been trem…
Too much information: why CDCL solvers need to forget learned clauses
Tom Krüger, Jan-Hendrik Lorenz, Florian Wörz
Conflict-driven clause learning (CDCL) is a remarkably successful paradigm for solving the satisfiability problem of propositional logic. Instead of a simple depth-first backtracki…
Evidence for Long-Tails in SLS Algorithms
Florian Wörz, Jan-Hendrik Lorenz
Stochastic local search (SLS) is a successful paradigm for solving the satisfiability problem of propositional logic. A recent development in this area involves solving not the ori…
Statistical privacy-preserving message dissemination for peer-to-peer networks
David Mödinger, Jan-Hendrik Lorenz, Fanz J. Hauck
Concerns for the privacy of communication is widely discussed in research and overall society. For the public financial infrastructure of blockchains, this discussion encompasses t…
On the Effect of Learned Clauses on Stochastic Local Search
Jan-Hendrik Lorenz, Florian Wörz
There are two competing paradigms in successful SAT solvers: Conflict-driven clause learning (CDCL) and stochastic local search (SLS). CDCL uses systematic exploration of the searc…
The Potential of Restarts for ProbSAT
Jan-Hendrik Lorenz, Julian Nickerl
This work analyses the potential of restarts for probSAT, a quite successful algorithm for k-SAT, by estimating its runtime distributions on random 3-SAT instances that are close t…
Runtime Distributions and Criteria for Restarts
Jan-Hendrik Lorenz
Randomized algorithms sometimes employ a restart strategy. After a certain number of steps, the current computation is aborted and restarted with a new, independent random seed. In…