An improved deterministic local search algorithm for 3-SAT-Reference-Cited by-同舟云学术

An improved deterministic local search algorithm for 3-SAT

Published:2004-12 Issue:1-3 Volume:329 Page:303-313
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Brueggemann Tobias,Kern Walter

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference4 articles.

1. A deterministic (2 - 2/(k + 1))n algorithm for k-SAT based on local search;Dantsin;Theoret. Comput. Sci.,2002

2. A Probabilistic 3-SAT Algorithm Further Improved;Hofmeister,2002

3. K. Iwama, S. Tamaki, Improved Upper Bounds for 3-SAT, in: Lecture Notes Series of ECCC, Electronic Colloquium on Computational Complexity, Vol. 53, University of Trier, 2003.

4. A probabilistic algorithm for k-SAT based on limited local search and restart;Schöning;Algorithmica,2002

Cited by 49 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions;Artificial Intelligence;2021-10

2. A Quantum-Inspired Classical Solver for Boolean k-Satisfiability Problems;2021 IEEE International Conference on Quantum Computing and Engineering (QCE);2021-10

3. Verification Model for Agent Coordination of Distributed Information Systems;2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS);2021-09-22

4. Chapter 16. Worst-Case Upper Bounds;Frontiers in Artificial Intelligence and Applications;2021-02-02

5. Chapter 1. A History of Satisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02