𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved deterministic local search algorithm for 3-SAT

✍ Scribed by Tobias Brueggemann; Walter Kern

Book ID
108280990
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
222 KB
Volume
329
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Towards a characterisation of the behavi
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
✍ Holger H. Hoos; Thomas StΓΌtzle πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 252 KB

Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behaviour of these algorithms is characterised by a random variable. The detailed knowledge of the run-time distribution provi

An improved deterministic algorithm for
An improved deterministic algorithm for generating different many-element random samples
✍ Amihood Amir; Emanuel Dar πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 625 KB

We consider the problem of deterministically selecting s uniformly random different m-element subsets of { 1, . . . , k}. The only known lower bound for the time to solve this problem is the trivial a( sm). The best two previously known solutions are of time 0( sm3 log m log log m) and 0( s( k + m))