Improving configuration checking for satisfiable random \(k\)-SAT instances
From MaRDI portal
Publication:513324
DOI10.1007/s10472-016-9515-9zbMath1404.68136OpenAlexW2395005896MaRDI QIDQ513324
André Abramé, Djamal Habet, Donia Toumi
Publication date: 6 March 2017
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-016-9515-9
Related Items
An efficient local search algorithm for solving maximum edge weight clique problem in large graphs, Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism, Go-MOCE: greedy order method of conditional expectations for Max Sat, An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem, An improved configuration checking-based algorithm for the unicost set covering problem, Improving configuration checking for satisfiable random \(k\)-SAT instances, Local search for diversified top-\(k\) clique search problem, Automated non-monotonic reasoning in System \textbf{P}, SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem, Using the method of conditional expectations to supply an improved starting point for CCLS
Uses Software
Cites Work
- Unnamed Item
- Local search for Boolean satisfiability with configuration checking and subscore
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- GRASP: a search algorithm for propositional satisfiability
- Improving Stochastic Local Search for SAT with a New Probability Distribution
- Theory and Applications of Satisfiability Testing
- A machine program for theorem-proving
- The complexity of theorem-proving procedures
- Theory and Applications of Satisfiability Testing
