Principles and Practice of Constraint Programming – CP 2004

DOI10.1007/B100482MaRDI QIDQ5900281zbMATH OpenOpenAlexFDO

Authors Bart Selman

Publication date 9 September 2008

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

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1113991
• scientific article; zbMATH DE number 7301529
• Statistical physics analysis of the backtrack resolution of random 3-SAT instances
• Random instances of problems in NP -- algorithms and statistical physics
• A complex-networks view of hard combinatorial search spaces

Cited in

(2)

• Visualizing SAT instances and runs of the DPLL algorithm
• A complex-networks view of hard combinatorial search spaces

Describes a project that uses

Uses Software

• Walksat

This page was built for publication: Principles and Practice of Constraint Programming – CP 2004

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