A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (Q2294575): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10472-019-09680-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10472-019-09680-4 / rank | |||
Normal rank | |||
Latest revision as of 20:59, 17 December 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
0 references
0 references
