An Efficient Implementation for WalkSAT

Liu, Sixue

doi:10.48550/arxiv.1510.07217

Search citation statements

Order By: Relevance

Paper Sections

Select...

Separated-non-caching Technology1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2017

Publication Types

Select...

Article1

Other1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We propose separated-non-caching, which is even more efficient. The term "separated" indicates that we have separated the non-caching process from the break value calculation, detailed can be found in the technical report (Liu 2015). We stress out that polyLS can make use of the separated-non-caching implementation to calculate break values, while probSAT cannot.…”

Section: Separated-non-caching Technologymentioning

confidence: 99%

Local Search for Hard SAT Formulas: The Strength of the Polynomial Law

Liu

Papakonstantinou

2016

AAAI

Self Cite

View full text Add to dashboard Cite

Random k-CNF formulas at the anticipated k-SAT phase-transition point are prototypical hard k-SAT instances. We develop a stochastic local search algorithm and study it both theoretically and through a large-scale experimental study. The algorithm comes as a result of a systematic study that contrasts rates at which a certain measure concentration phenomenon occurs. This study yields a new stochastic rule for local search. A strong point of our contribution is the conceptual simplicity of our algorithm. More importantly, the empirical results overwhelmingly indicate that our algorithm outperforms the state-of-the-art. This includes a number of winners and medalist solvers from the recent SAT Competitions.

show abstract

Section: Separated-non-caching Technologymentioning

confidence: 99%