An average analysis of backtracking on random constraint satisfaction problems

DOI10.1023/A:1012328830929zbMath1314.68165OpenAlexW1499036193MaRDI QIDQ2349811

Wei Li, Ke Xu

Publication date: 17 June 2015

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012328830929

zbMATH Keywords

analysis of algorithmsCSPaverage complexitybacktracking algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Partition search for non-binary constraint satisfaction ⋮ On the average similarity degree between solutions of random \(k\)-SAT and random CSPs.

This page was built for publication: An average analysis of backtracking on random constraint satisfaction problems