Finite semigroups imposing tractable constraints

Finite semigroups imposing tractable constraints

Bibliographic Details
Main Authors:	Bulatov, A, Jeavons, P, Volkov, M
Format:	Conference item
Published:	World Scientific‚ Singapore 2002

Similar Items

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

Perfect Constraints Are Tractable
by: Salamon, A, et al.
Published: (2008)

Perfect Constraints Are Tractable
by: Salamon, A, et al.
Published: (2008)

Tractable valued constraints
by: Jeavons, P, et al.
Published: (2012)

Tractable Valued Constraints
by: Jeavons, P, et al.
Published: (2013)

Tractable Disjunctive Constraints
by: D.A.Cohen, et al.
Published: (1997)

Characterising Tractable Constraints
by: M.C.Cooper, et al.
Published: (1994)

Tractable Benchmarks For Constraint Programming
by: Petke, J, et al.
Published: (2009)

Tractable Constraints on Ordered Domains
by: P.G.Jeavons, et al.
Published: (1995)

Building tractable disjunctive constraints
by: Cohen, D, et al.
Published: (2000)

Building tractable disjunctive constraints
by: Cohen, D, et al.
Published: (2000)

Tractable Combinations of Global Constraints
by: Cohen, D, et al.
Published: (2013)

Tractable combinations of global constraints
by: Cohen, D, et al.
Published: (2013)

A Unifying Framework for Tractable Constraints
by: P.G.Jeavons, et al.
Published: (1995)

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

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

A Survey of Tractable Constraint Satisfaction Problems
by: J.K.Pearson, et al.
Published: (1997)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
by: Cooper, M, et al.
Published: (2010)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
by: Cooper, M, et al.
Published: (2010)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
by: Cooper, M, et al.
Published: (2010)

A unified theory of structural tractability for constraint satisfaction problems
by: Cohen, D, et al.
Published: (2008)

A unified theory of structural tractability for constraint satisfaction problems
by: Cohen, D, et al.
Published: (2008)

Constraint Tractability Theory And Its Application to the Product Development Process for a Constraint−Based Scheduler
by: Purvis, L, et al.
Published: (1999)

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

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

The order encoding: from tractable CSP to tractable SAT
by: Petke, J, et al.
Published: (2011)

The order encoding: From tractable CSP to tractable SAT
by: Petke, J, et al.
Published: (2011)

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

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

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

The order encoding: from tractable CSP to tractable SAT (extended abstract)
by: Petke, J, et al.
Published: (2011)

A Test for Tractability
by: P.G.Jeavons, et al.
Published: (1996)

On Tractable Queries and Constraints
by: Gottlob, G, et al.
Published: (1999)

Implementing a test for tractability
by: Gault, R, et al.
Published: (2004)

Implementing a test for tractability
by: Gault, R, et al.
Published: (2004)

New tractable classes from old
by: Cohen, D, et al.
Published: (2003)

New Tractable Classes From Old
by: Cohen, D, et al.
Published: (2003)

Hybrid tractability of soft constraint problems
by: Cooper, M, et al.
Published: (2010)

Hybrid tractability of valued constraint problems
by: Cooper, M, et al.
Published: (2011)

Hybrid tractability of soft constraint problems
by: Cooper, M, et al.
Published: (2010)