Quantified constraints: algorithms and complexity

Quantified constraints: algorithms and complexity

Mostrar otras versiones (1)

Detalles Bibliográficos
Autores principales:	Börner, F, Bulatov, A, Jeavons, P, Krokhin, A
Formato:	Conference item
Publicado:	2003

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

The complexity of valued constraint models
por: Živný, S, et al.
Publicado: (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: (2001)

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

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

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

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

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

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

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

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