A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (Q2294575): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: clpfd / rank | |||
Normal rank | |||
Revision as of 12:18, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A subdivision algorithm to reason on high-degree polynomial constraints over finite domains |
scientific article |
Statements
A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (English)
0 references
11 February 2020
0 references
high-degree polynomial constraints
0 references
polynomial constraints over finite domains
0 references
constraint satisfaction problems
0 references
