liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Finite Domain Constraint Satisfaction Using Quantum Computation
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
2002 (English)In: Mathematical Foundations of Computer Science, 27th International Symposium MFCS-2002,2002, Heidelberg: Springer Verlag , 2002, 93- p.Conference paper, Published paper (Refereed)
Abstract [en]

We present a quantum algorithm for finite domain constraint solving, where the constraints have arity 2. It is complete and runs in time, where d is size of the domain of the variables and n the number of variables. For the case of d=3 we provide a method to obtain an upper time bound of . 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.2185^n) time.

Place, publisher, year, edition, pages
Heidelberg: Springer Verlag , 2002. 93- p.
Series
Lecture Notes in Computer Science, 2420
Keyword [en]
constraint satisfaction, CSP, quantum computing
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-24611Local ID: 6787OAI: oai:DiVA.org:liu-24611DiVA: diva2:244933
Conference
MFCS-2002
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2017-02-23

Open Access in DiVA

No full text

Other links

http://www.springerlink.com/link.asp?id=x43w94wnwla6r2w6

Authority records BETA

Angelsmark, OlaDahllöf, VilhelmJonsson, Peter

Search in DiVA

By author/editor
Angelsmark, OlaDahllöf, VilhelmJonsson, Peter
By organisation
The Institute of TechnologyTCSLAB - Theoretical Computer Science Laboratory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 87 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf