Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases (Q4695386): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q94167498, #quickstatements; #temporary_batch_1707232231678 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/0406019 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1985065217 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:03, 19 March 2024
scientific article; zbMATH DE number 205111
Language | Label | Description | Also known as |
---|---|---|---|
English | Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases |
scientific article; zbMATH DE number 205111 |
Statements
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases (English)
0 references
31 October 1994
0 references
computational complexity
0 references
Minkowski sum
0 references
polytope
0 references
hyperplane arrangement
0 references
mathematical programming
0 references
computational convexity
0 references
computer algebra
0 references
Gröbner bases
0 references
polynomial
0 references
term order
0 references
Newton polytope
0 references
Hilbert function
0 references