An analysis of backtrack-free algorithms on a constraint satisfaction problem with growing domains

MaRDI QIDQ5497925zbMATH OpenFDO

Authors Wei Xu

Publication date 11 February 2015

zbMATH Keywords

backtrack-free algorithmconstraint satisfaction problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Backtracking and random constraint satisfaction
• scientific article; zbMATH DE number 1113993
• An average analysis of backtracking on random constraint satisfaction problems
• Principles and Practice of Constraint Programming – CP 2003
• A theoretical evaluation of selected backtracking algorithms.

Cited in

(2)

• 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

This page was built for publication: An analysis of backtrack-free algorithms on a constraint satisfaction problem with growing domains

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