The complexity of maximal constraint languages

The complexity of maximal constraint languages

Veure altres versions (1)

Dades bibliogràfiques
Autors principals:	Bulatov, A, Krokhin, A, Jeavons, P
Format:	Conference item
Publicat:	2001

Ítems similars

The complexity of maximal constraint languages
per: Bulatov, A, et al.
Publicat: (2001)

The Complexity of Constraint Satisfaction: An Algebraic Approach
per: Krokhin, A, et al.
Publicat: (2004)

Classifying the complexity of constraints using finite algebras
per: Bulatov, A, et al.
Publicat: (2005)

Classifying the complexity of constraints using finite algebras
per: Bulatov, A, et al.
Publicat: (2005)

Quantified constraints: algorithms and complexity
per: Börner, F, et al.
Publicat: (2003)

Quantified constraints: Algorithms and complexity
per: Borner, F, et al.
Publicat: (2003)

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

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

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

The complexity of constraint satisfaction games and QCSP
per: Boerner, F, et al.
Publicat: (2009)

Constraint satisfaction problems and finite algebras
per: Bulatov, A, et al.
Publicat: (2000)

Constraint satisfaction problems and finite algebras
per: Bulatov, A, et al.
Publicat: (2000)

A maximal tractable class of soft constraints
per: Cohen, D, et al.
Publicat: (2004)

A maximal tractable class of soft constraints
per: Cohen, D, et al.
Publicat: (2004)

Soft constraints: Complexity and multimorphisms
per: Cohen, D, et al.
Publicat: (2003)

The complexity of soft constraint satisfaction
per: Cohen, D, et al.
Publicat: (2006)

The complexity of soft constraint satisfaction
per: Cohen, D, et al.
Publicat: (2006)

Soft constraints: complexity and multimorphsims
per: Cohen, D, et al.
Publicat: (2003)

The complexity of constraint languages
per: Cohen, D, et al.
Publicat: (2006)

Constraint satisfaction problems on intervals and lengths
per: Krokhin, A, et al.
Publicat: (2004)

Constraint satisfaction problems on intervals and lengths
per: Krokhin, A, et al.
Publicat: (2004)

Structural Theory of Automata‚ Semigroups‚ and Universal Algebra
per: Krokhin, A, et al.
Publicat: (2003)

Chapter 8 The complexity of constraint languages
per: Cohen, D, et al.
Publicat: (2006)

An algebraic approach to multi-sorted constraints
per: Bulatov, A, et al.
Publicat: (2003)

An algebraic approach to multi−sorted constraints
per: Bulatov, A, et al.
Publicat: (2003)

Tractable constraints closed under a binary operation
per: Bulatov, A, et al.
Publicat: (2000)

Finite semigroups imposing tractable constraints
per: Bulatov, A, et al.
Publicat: (2002)

The constraint satisfaction problem: complexity and approximability
per: Krokhin, A, et al.
Publicat: (2017)

Binarisation for valued constraint satisfaction problems
per: Cohen, D, et al.
Publicat: (2017)

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

The complexity of valued constraint models
per: Živný, S, et al.
Publicat: (2009)

The Complexity of Valued Constraint Models.
per: Zivny, S, et al.
Publicat: (2009)

The complexity of valued constraint models
per: Živný, S, et al.
Publicat: (2009)

Supermodular Functions and the Complexity of MAX CSP
per: Cohen, D, et al.
Publicat: (2004)

Supermodular functions and the complexity of MAX CSP
per: Cohen, D, et al.
Publicat: (2005)

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

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

An algebraic characterisation of complexity for valued constraints
per: Cohen, D, et al.
Publicat: (2006)

An algebraic characterisation of complexity for valued constraints
per: Cohen, D, et al.
Publicat: (2006)

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