Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
The complexity of constraint s...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
The complexity of constraint satisfaction games and QCSP
Show other versions (1)
Bibliographic Details
Main Authors:
Börner, F
,
Bulatov, A
,
Chen, H
,
Jeavons, P
,
Krokhin, A
Format:
Journal article
Published:
2009
Holdings
Description
Other Versions (1)
Similar Items
Staff View
Similar Items
The complexity of constraint satisfaction games and QCSP
by: Boerner, F, et al.
Published: (2009)
The Complexity of Constraint Satisfaction: An Algebraic Approach
by: Krokhin, A, et al.
Published: (2004)
Quantified constraints: Algorithms and complexity
by: Borner, F, et al.
Published: (2003)
Quantified constraints: algorithms and complexity
by: Börner, F, et al.
Published: (2003)
Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
by: Krokhin, A, et al.
Published: (2003)