On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing

DOI10.1007/978-3-642-40313-2_16zbMath1378.68058arXiv1303.7077OpenAlexW2767165421MaRDI QIDQ2849906

Christoph Berkholz, Oleg Verbitsky

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.7077

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

On the speed of constraint propagation and the time complexity of arc consistency testing ⋮ Bounds for the Quantifier Depth in Finite-Variable Logics

This page was built for publication: On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing