Pages that link to "Item:Q360253"
From MaRDI portal
The following pages link to Representing and solving finite-domain constraint problems using systems of polynomials (Q360253):
Displaying 6 items.
- Counting and enumerating feasible rotating schedules by means of Gröbner bases (Q2228806) (← links)
- A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (Q2294575) (← links)
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form (Q2363599) (← links)
- Direct application of constraints to symmetric algebraic systems (Q4850211) (← links)
- Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism (Q5096588) (← links)
- A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form (Q5215368) (← links)