Representing and Solving Finite−Domain Constraint Problems Using Systems of Polynomials

Representing and Solving Finite−Domain Constraint Problems Using Systems of Polynomials

Veure altres versions (2)

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...

Descripció completa

Dades bibliogràfiques
Autors principals:	Jefferson, C, Jeavons, P, Green, M, van Dongen, M
Format:	Report
Publicat:	Oxford University Computing Laboratory 2007

Ítems similars

Representing and solving finite-domain constraint problems using systems of polynomials
per: Jefferson, C, et al.
Publicat: (2013)

Representing and solving finite−domain constraint problems using systems of polynomials
per: Jefferson, C, et al.
Publicat: (2013)

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

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

A polynomial time solution to constraint satisfaction problems by neural−like P systems
per: Xu, L, et al.
Publicat: (2013)

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

Representing by Orthogonal Polynomials for Sums of Finite Products of Fubini Polynomials
per: Dae San Kim, et al.
Publicat: (2019-03-01)

Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$
per: Milan Banković
Publicat: (2017-04-01)

Finite semigroups imposing tractable constraints
per: Bulatov, A, et al.
Publicat: (2002)

Symmetry definitions for constraint satisfaction problems
per: Cohen, D, et al.
Publicat: (2006)

Symmetry definitions for constraint satisfaction problems
per: Cohen, D, et al.
Publicat: (2005)

Symmetry definitions for constraint satisfaction problems
per: Cohen, D, et al.
Publicat: (2005)

Symmetry definitions for constraint satisfaction problems
per: Cohen, D, et al.
Publicat: (2006)

Representing by several orthogonal polynomials for sums of finite products of Chebyshev polynomials of the first kind and Lucas polynomials
per: Taekyun Kim, et al.
Publicat: (2019-04-01)

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

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

Representing fitness landscapes by valued constraints to understand the complexity of local search
per: Kaznatcheev, A, et al.
Publicat: (2019)

Finite difference method and algebraic polynomial interpolation for numerically solving Poisson's equation over arbitrary domains
per: Tsugio Fukuchi
Publicat: (2014-06-01)

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

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

Solving polynomial systems using continuation for engineering and scientific problems /
per: Morgan, Alexander, 1945-
Publicat: (c200)

Robust DOF control for uncertain polynomial fuzzy systems in finite frequency domain
per: Redouane Chaibi, et al.
Publicat: (2021-12-01)

Expressiveness of Binary Constraints for the Frequency Assignment Problem
per: N.W.Dunkin, et al.
Publicat: (1997)

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

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

A complete characterization of complexity for Boolean constraint optimization problems
per: Cohen, D, et al.
Publicat: (2004)

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

A complete characterization of complexity for boolean constraint optimization problems
per: Cohen, D, et al.
Publicat: (2004)

Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem
per: Hasan, Mohammad Khatim
Publicat: (2008)

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

Decomposing Constraint Satisfaction Problems Using Database Techniques
per: M.Gyssens, et al.
Publicat: (1994)

Binary constraint satisfaction problems defined by excluded topological minors
per: Cohen, D, et al.
Publicat: (2018)

Constraint symmetry and solution symmetry
per: Cohen, D, et al.
Publicat: (2006)

Representing Constraint Systems with Omega
per: Koton, Phyllis A.
Publicat: (2008)

Presenting Constraints
per: Jeavons, P
Publicat: (2009)

Presenting Constraints
per: Jeavons, P
Publicat: (2009)

On the prime values represented by polynomials
per: Foo, Timothy
Publicat: (2013)

Representing polynomial of ST-CONNECTIVITY
per: Jānis Iraids, et al.
Publicat: (2024-04-01)

Representing and solving decision problems with limited information
per: Lauritzen, S, et al.
Publicat: (2001)

Improved Finite Difference Technique via Adomian Polynomial to Solve the Coupled Drinfeld’s–Sokolov–Wilson System
per: Israa Th. Younis, et al.
Publicat: (2023-01-01)