scientific article; zbMATH DE number 1467488

MaRDI QIDQ4488090zbMATH OpenFDO

Authors

Publication date 25 July 2000

zbMATH Keywords

search algorithmWSat

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
• Local backbones
• SAT local search algorithms: Worst-case study
• SAT local search algorithms: Worst-case study
• Local search algorithms for SAT: Worst-case analysis

Cited in

(12)

• An efficient approach to solving random \(k\)-SAT problems
• Problem difficulty for tabu search in job-shop scheduling
• SAT problems with chains of dependent variables
• Recognizing frozen variables in constraint satisfaction problems
• Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
• How to fake an RSA signature by encoding modular root finding as a SAT problem
• Visualizing SAT instances and runs of the DPLL algorithm
• Local backbones
• Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
• Computational complexity of auditing finite attributes in statistical databases
• Towards backbone computing: a greedy-whitening based approach
• On market-inspired approaches to propositional satisfiability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488090)