Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325855
DOI10.1007/b95238zbMath1204.68211OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325855
Guilhem Semerjian, Remi 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
Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Performances of pure random walk algorithms on constraint satisfaction problems with growing domains, The state of SAT, The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems, Pairs of SAT-assignments in random Boolean formulæ, Geometrical organization of solutions to random linear Boolean equations, Walksat Stalls Well Below Satisfiability
