Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems

Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich. Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems. In Hisham Haddad, editor, Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, April 23-27, 2006. pages 1640-1644, ACM, 2006. [doi]

@inproceedings{DantsinWK06,
  title = {Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems},
  author = {Evgeny Dantsin and Alexander Wolpert and Vladik Kreinovich},
  year = {2006},
  doi = {10.1145/1141277.1141663},
  url = {http://doi.acm.org/10.1145/1141277.1141663},
  tags = {constraints},
  researchr = {https://researchr.org/publication/DantsinWK06},
  cites = {0},
  citedby = {0},
  pages = {1640-1644},
  booktitle = {Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, April 23-27, 2006},
  editor = {Hisham Haddad},
  publisher = {ACM},
  isbn = {1-59593-108-2},
}