Reconciling conflicting combinatorial preprocessors for geometric constraint systems (Q3070041)
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: Reconciling conflicting combinatorial preprocessors for geometric constraint systems |
scientific article; zbMATH DE number 5843881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reconciling conflicting combinatorial preprocessors for geometric constraint systems |
scientific article; zbMATH DE number 5843881 |
Statements
RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS (English)
0 references
2 February 2011
0 references
combinatorial preprocessing of algebraic systems
0 references
graph-based optimization of algebraic complexity
0 references
3D geometric constraint systems
0 references
solving polynomial systems
0 references
matroids
0 references
graph algorithms
0 references
0.7474244236946106
0 references
0.745308518409729
0 references
0.7364609837532043
0 references
