Local search for Boolean satisfiability with configuration checking and subscore
From MaRDI portal
Publication:490437
Recommendations
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- Improving local search for random 3-SAT using quantitative configuration checking
- CCAnr: a configuration checking based local search solver for non-random satisfiability
- scientific article; zbMATH DE number 956863
- SAT local search algorithms: Worst-case study
Cites work
- An empirical study of optimal noise and runtime distributions in local search
- An improved exponential-time algorithm for k -SAT
- Captain Jack: new variable selection heuristics in local search for SAT
- Choosing probability distributions for stochastic local search and the role of make versus break
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Defining tabu list size and aspiration criterion within tabu search methods
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- Improving local search for random 3-SAT using quantitative configuration checking
- Improving stochastic local search for SAT with a new probability distribution
- Local search algorithms for SAT: an empirical evaluation
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- NuMVC: an efficient local search algorithm for minimum vertex cover
- Reactive local search for the maximum clique problem
- Stochastic local search. Foundations and applications.
- Survey propagation: An algorithm for satisfiability
- Tabu Search—Part I
- Tabu Search—Part II
- Theoretical aspects of local search.
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Threshold values of random K‐SAT from the cavity method
Cited in
(24)- Solving the set packing problem via a maximum weighted independent set heuristic
- CCAnr: a configuration checking based local search solver for non-random satisfiability
- Improving local search for random 3-SAT using quantitative configuration checking
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- XOR local search for Boolean Brent equations
- scientific article; zbMATH DE number 2084740 (Why is no real title available?)
- An efficient local search framework for the minimum weighted vertex cover problem
- Scoring functions based on second level score for \(k\)-SAT with long clauses
- CCASat
- New local search methods for partial MaxSAT
- Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set
- Timescales of Boolean satisfiability solver using continuous-time dynamical system
- Local Search For Satisfiability Modulo Integer Arithmetic Theories
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- Local Search for SMT on Linear Integer Arithmetic
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Local search for diversified top-\(k\) clique search problem
- Effect of initial assignment on local search performance for Max Sat
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- Local search for solving satisfiability of polynomial formulas
- Using the method of conditional expectations to supply an improved starting point for CCLS
This page was built for publication: Local search for Boolean satisfiability with configuration checking and subscore
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490437)
