A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (Q2294575)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A subdivision algorithm to reason on high-degree polynomial constraints over finite domains |
scientific article; zbMATH DE number 7166037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A subdivision algorithm to reason on high-degree polynomial constraints over finite domains |
scientific article; zbMATH DE number 7166037 |
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
0.8635804057121277
0 references
0.8007340431213379
0 references
0.7654344439506531
0 references
0.7485548257827759
0 references
0.6984447240829468
0 references
