Finite semigroups imposing tractable constraints

Finite semigroups imposing tractable constraints

Detalles Bibliográficos
Main Authors:	Bulatov, A, Jeavons, P, Volkov, M
Formato:	Conference item
Publicado:	World Scientific‚ Singapore 2002

Títulos similares

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

Perfect Constraints Are Tractable
por: Salamon, A, et al.
Publicado: (2008)

Perfect Constraints Are Tractable
por: Salamon, A, et al.
Publicado: (2008)

Tractable valued constraints
por: Jeavons, P, et al.
Publicado: (2012)

Tractable Valued Constraints
por: Jeavons, P, et al.
Publicado: (2013)

Tractable Disjunctive Constraints
por: D.A.Cohen, et al.
Publicado: (1997)

Characterising Tractable Constraints
por: M.C.Cooper, et al.
Publicado: (1994)

Tractable Benchmarks For Constraint Programming
por: Petke, J, et al.
Publicado: (2009)

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

Building tractable disjunctive constraints
por: Cohen, D, et al.
Publicado: (2000)

Building tractable disjunctive constraints
por: Cohen, D, et al.
Publicado: (2000)

Tractable Combinations of Global Constraints
por: Cohen, D, et al.
Publicado: (2013)

Tractable combinations of global constraints
por: Cohen, D, et al.
Publicado: (2013)

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

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)

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

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

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

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

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

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

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

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)

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

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

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

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)

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

A Test for Tractability
por: P.G.Jeavons, et al.
Publicado: (1996)

On Tractable Queries and Constraints
por: Gottlob, G, et al.
Publicado: (1999)

Implementing a test for tractability
por: Gault, R, et al.
Publicado: (2004)

Implementing a test for tractability
por: Gault, R, et al.
Publicado: (2004)

New tractable classes from old
por: Cohen, D, et al.
Publicado: (2003)

New Tractable Classes From Old
por: Cohen, D, et al.
Publicado: (2003)

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

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

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