Representing and Solving Finite−Domain Constraint Problems Using Systems of Polynomials
In this paper we investigate the use of a system of multivariate polynomials to represent the restrictions imposed by a collection of constraints. The advantage of using polynomials to represent constraints is that it allows many different forms of constraints to be treated in a uniform way. Systems...
Egile Nagusiak: | Jefferson, C, Jeavons, P, Green, M, van Dongen, M |
---|---|
Formatua: | Report |
Argitaratua: |
Oxford University Computing Laboratory
2007
|
Antzeko izenburuak
Symmetry definitions for constraint satisfaction problems
nork: Cohen, D, et al.
Argitaratua: (2006)
nork: Cohen, D, et al.
Argitaratua: (2006)
Antzeko izenburuak
-
Representing and solving finite-domain constraint problems using systems of polynomials
nork: Jefferson, C, et al.
Argitaratua: (2013) -
Representing and solving finite−domain constraint problems using systems of polynomials
nork: Jefferson, C, et al.
Argitaratua: (2013) -
Constraint satisfaction problems and finite algebras
nork: Bulatov, A, et al.
Argitaratua: (2000) -
Constraint satisfaction problems and finite algebras
nork: Bulatov, A, et al.
Argitaratua: (2000) -
A polynomial time solution to constraint satisfaction problems by neural−like P systems
nork: Xu, L, et al.
Argitaratua: (2013)