Quantified constraints: algorithms and complexity

Quantified constraints: algorithms and complexity

Show other versions (1)

Detalhes bibliográficos
Main Authors:	Börner, F, Bulatov, A, Jeavons, P, Krokhin, A
Formato:	Conference item
Publicado em:	2003

Registos relacionados

Quantified constraints: Algorithms and complexity
Por: Borner, F, et al.
Publicado em: (2003)

The complexity of constraint satisfaction games and QCSP
Por: Börner, F, et al.
Publicado em: (2009)

The complexity of maximal constraint languages
Por: Bulatov, A, et al.
Publicado em: (2001)

The complexity of maximal constraint languages
Por: Bulatov, A, et al.
Publicado em: (2001)

The Complexity of Constraint Satisfaction: An Algebraic Approach
Por: Krokhin, A, et al.
Publicado em: (2004)

Classifying the complexity of constraints using finite algebras
Por: Bulatov, A, et al.
Publicado em: (2005)

Classifying the complexity of constraints using finite algebras
Por: Bulatov, A, et al.
Publicado em: (2005)

Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
Por: Krokhin, A, et al.
Publicado em: (2003)

Functions of multiple−valued logic and the complexity of constraint satisfaction: A short survey
Por: Krokhin, A, et al.
Publicado em: (2003)

The complexity of constraint satisfaction games and QCSP
Por: Boerner, F, et al.
Publicado em: (2009)

Constraint satisfaction problems and finite algebras
Por: Bulatov, A, et al.
Publicado em: (2000)

Constraint satisfaction problems and finite algebras
Por: Bulatov, A, et al.
Publicado em: (2000)

Soft constraints: Complexity and multimorphisms
Por: Cohen, D, et al.
Publicado em: (2003)

Soft constraints: complexity and multimorphsims
Por: Cohen, D, et al.
Publicado em: (2003)

The complexity of soft constraint satisfaction
Por: Cohen, D, et al.
Publicado em: (2006)

The complexity of soft constraint satisfaction
Por: Cohen, D, et al.
Publicado em: (2006)

Constraint satisfaction problems on intervals and lengths
Por: Krokhin, A, et al.
Publicado em: (2004)

Constraint satisfaction problems on intervals and lengths
Por: Krokhin, A, et al.
Publicado em: (2004)

Structural Theory of Automata‚ Semigroups‚ and Universal Algebra
Por: Krokhin, A, et al.
Publicado em: (2003)

An algebraic approach to multi-sorted constraints
Por: Bulatov, A, et al.
Publicado em: (2003)

An algebraic approach to multi−sorted constraints
Por: Bulatov, A, et al.
Publicado em: (2003)

Tractable constraints closed under a binary operation
Por: Bulatov, A, et al.
Publicado em: (2000)

A maximal tractable class of soft constraints
Por: Cohen, D, et al.
Publicado em: (2004)

A maximal tractable class of soft constraints
Por: Cohen, D, et al.
Publicado em: (2004)

Finite semigroups imposing tractable constraints
Por: Bulatov, A, et al.
Publicado em: (2002)

The constraint satisfaction problem: complexity and approximability
Por: Krokhin, A, et al.
Publicado em: (2017)

Binarisation for valued constraint satisfaction problems
Por: Cohen, D, et al.
Publicado em: (2017)

The complexity of constraint languages
Por: Cohen, D, et al.
Publicado em: (2006)

The complexity of valued constraint models
Por: Živný, S, et al.
Publicado em: (2009)

The Complexity of Valued Constraint Models.
Por: Zivny, S, et al.
Publicado em: (2009)

The complexity of valued constraint models
Por: Živný, S, et al.
Publicado em: (2009)

A complete classification of complexity in Allen's algebra in the presence of a non−trivial basic relation
Por: Krokhin, A, et al.
Publicado em: (2001)

Supermodular Functions and the Complexity of MAX CSP
Por: Cohen, D, et al.
Publicado em: (2004)

Supermodular functions and the complexity of MAX CSP
Por: Cohen, D, et al.
Publicado em: (2005)

Supermodular functions and the complexity of M-AX CSP
Por: Cohen, D, et al.
Publicado em: (2005)

Chapter 8 The complexity of constraint languages
Por: Cohen, D, et al.
Publicado em: (2006)

The complexity of global cardinality constraints
Por: Andrei A. Bulatov, et al.
Publicado em: (2010-10-01)

An algebraic characterisation of complexity for valued constraints
Por: Cohen, D, et al.
Publicado em: (2006)

An algebraic characterisation of complexity for valued constraints
Por: Cohen, D, et al.
Publicado em: (2006)

Supermodularity on chains and complexity of maximum constraint satisfaction
Por: Vladimir Deineko, et al.
Publicado em: (2005-01-01)