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

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

Pokaż inne wersje (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...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy:	Jefferson, C, Jeavons, P, Green, M, van Dongen, M
Format:	Report
Wydane:	Oxford University Computing Laboratory 2007

Podobne zapisy

Representing and solving finite-domain constraint problems using systems of polynomials
od: Jefferson, C, i wsp.
Wydane: (2013)

Representing and solving finite−domain constraint problems using systems of polynomials
od: Jefferson, C, i wsp.
Wydane: (2013)

Constraint satisfaction problems and finite algebras
od: Bulatov, A, i wsp.
Wydane: (2000)

Constraint satisfaction problems and finite algebras
od: Bulatov, A, i wsp.
Wydane: (2000)

A polynomial time solution to constraint satisfaction problems by neural−like P systems
od: Xu, L, i wsp.
Wydane: (2013)

Tractable Constraints on Ordered Domains
od: P.G.Jeavons, i wsp.
Wydane: (1995)

Representing by Orthogonal Polynomials for Sums of Finite Products of Fubini Polynomials
od: Dae San Kim, i wsp.
Wydane: (2019-03-01)

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

Finite semigroups imposing tractable constraints
od: Bulatov, A, i wsp.
Wydane: (2002)

Symmetry definitions for constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2006)

Symmetry definitions for constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2005)

Symmetry definitions for constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2005)

Symmetry definitions for constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2006)

Representing by several orthogonal polynomials for sums of finite products of Chebyshev polynomials of the first kind and Lucas polynomials
od: Taekyun Kim, i wsp.
Wydane: (2019-04-01)

Classifying the complexity of constraints using finite algebras
od: Bulatov, A, i wsp.
Wydane: (2005)

Classifying the complexity of constraints using finite algebras
od: Bulatov, A, i wsp.
Wydane: (2005)

Representing fitness landscapes by valued constraints to understand the complexity of local search
od: Kaznatcheev, A, i wsp.
Wydane: (2019)

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

Constraint satisfaction problems on intervals and lengths
od: Krokhin, A, i wsp.
Wydane: (2004)

Constraint satisfaction problems on intervals and lengths
od: Krokhin, A, i wsp.
Wydane: (2004)

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

Robust DOF control for uncertain polynomial fuzzy systems in finite frequency domain
od: Redouane Chaibi, i wsp.
Wydane: (2021-12-01)

Expressiveness of Binary Constraints for the Frequency Assignment Problem
od: N.W.Dunkin, i wsp.
Wydane: (1997)

A Survey of Tractable Constraint Satisfaction Problems
od: J.K.Pearson, i wsp.
Wydane: (1997)

A unified theory of structural tractability for constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2008)

A complete characterization of complexity for Boolean constraint optimization problems
od: Cohen, D, i wsp.
Wydane: (2004)

A unified theory of structural tractability for constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2008)

A complete characterization of complexity for boolean constraint optimization problems
od: Cohen, D, i wsp.
Wydane: (2004)

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

Binarisation for valued constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2017)

Decomposing Constraint Satisfaction Problems Using Database Techniques
od: M.Gyssens, i wsp.
Wydane: (1994)

Binary constraint satisfaction problems defined by excluded topological minors
od: Cohen, D, i wsp.
Wydane: (2018)

Constraint symmetry and solution symmetry
od: Cohen, D, i wsp.
Wydane: (2006)

Representing Constraint Systems with Omega
od: Koton, Phyllis A.
Wydane: (2008)

Presenting Constraints
od: Jeavons, P
Wydane: (2009)

Presenting Constraints
od: Jeavons, P
Wydane: (2009)

On the prime values represented by polynomials
od: Foo, Timothy
Wydane: (2013)

Representing polynomial of ST-CONNECTIVITY
od: Jānis Iraids, i wsp.
Wydane: (2024-04-01)

Representing and solving decision problems with limited information
od: Lauritzen, S, i wsp.
Wydane: (2001)

Improved Finite Difference Technique via Adomian Polynomial to Solve the Coupled Drinfeld’s–Sokolov–Wilson System
od: Israa Th. Younis, i wsp.
Wydane: (2023-01-01)