Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68211OpenAlexW2494235144MaRDI QIDQ5325855FDOQ5325855

Authors Guilhem Semerjian, R. Monasson

Publication date 24 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95238

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Recommendations

• A study of pure random walk algorithms on constraint satisfaction problems with growing domains
• Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
• Walksat Stalls Well Below Satisfiability
• Pushing Random Walk Beyond Golden Ratio
• Theory and Applications of Satisfiability Testing

Cited in

(7)

• Pairs of SAT-assignments in random Boolean formulæ
• Geometrical organization of solutions to random linear Boolean equations
• The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
• The state of SAT
• A study of pure random walk algorithms on constraint satisfaction problems with growing domains
• Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
• Walksat Stalls Well Below Satisfiability

This page was built for publication: Theory and Applications of Satisfiability Testing

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