Classifying the complexity of constraints using finite algebras

Classifying the complexity of constraints using finite algebras

Show other versions (1)

Bibliografske podrobnosti
Main Authors:	Bulatov, A, Jeavons, P, Krokhin, A
Format:	Journal article
Izdano:	2005

Podobne knjige/članki

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

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

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

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

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

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

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

Quantified constraints: Algorithms and complexity
od: Borner, F, et al.
Izdano: (2003)

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

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

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

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

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

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

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

Finite semigroups imposing tractable constraints
od: Bulatov, A, et al.
Izdano: (2002)

Soft constraints: Complexity and multimorphisms
od: Cohen, D, et al.
Izdano: (2003)

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

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

Soft constraints: complexity and multimorphsims
od: Cohen, D, et al.
Izdano: (2003)

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

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

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

Algebraic structures in combinatorial problems
od: Bulatov, A, et al.
Izdano: (2001)

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

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

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
od: Krokhin, A, et al.
Izdano: (2003)

Reasoning about temporal relations : the tractable subalgebras of Allen's interval algebra
od: Krokhin, A, et al.
Izdano: (2003)

Constraints and Universal Algebra
od: P.G.Jeavons, et al.
Izdano: (1998)

An algebraic theory of complexity for valued constraints: Establishing a Galois connection
od: Cohen, D, et al.
Izdano: (2010)

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection.
od: Cohen, D, et al.
Izdano: (2011)

An algebraic theory of complexity for valued constraints: Establishing a Galois connection
od: Cohen, D, et al.
Izdano: (2011)

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
od: Cohen, D, et al.
Izdano: (2010)

An algebraic theory of complexity for valued constraints: Establishing a Galois connection
od: Cohen, D, et al.
Izdano: (2011)

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

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

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

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

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

The complexity of constraint languages
od: Cohen, D, et al.
Izdano: (2006)