Abstract
We present a quantum algorithm for finite domain constraint solving, where the constraints have arity 2. It is complete and runs in O(([d/2])n/2) time, where d is size of the domain of the variables and n the number of variables. For the case of d = 3w e provide a method to obtain an upper time bound of O(8n/8) ≈ O(1.2968n). Also for d = 5 the upper bound has been improved. Using this method in a slightly different way we can decide 3-colourability in O(1.2185n) time.
Cite
CITATION STYLE
Angelsmark, O., Dahllöf, V., & Jonsson, P. (2002). Finite domain constraint satisfaction using quantum computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2420, pp. 93–103). Springer Verlag. https://doi.org/10.1007/3-540-45687-2_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
