A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms
[chapter]
2013
Lecture Notes in Computer Science
In this paper, we investigate the complexity of algorithms for solving CSPs which are classically implemented in real practical solvers, such as Forward Checking or Bactracking with Arc Consistency (RFL or MAC).. We introduce a new parameter for measuring their complexity and then we derive new complexity bounds. By relating the complexity of CSP algorithms to graph-theoretical parameters, our analysis allows us to define new tractable classes, which can be solved directly by the usual CSP
doi:10.1007/978-3-642-38171-3_5
fatcat:nnkgshgetzhophuqvxhwv4njhy