The complexity of generating functions for integer points in polyhedra and beyond (Q5491012)
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: The complexity of generating functions for integer points in polyhedra and beyond |
scientific article; zbMATH DE number 5057509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of generating functions for integer points in polyhedra and beyond |
scientific article; zbMATH DE number 5057509 |
Statements
26 September 2006
0 references
Lattice point, rational polytope, generating function, rational function, Laurent polynomial, integer semigroup, Hilbert basis, efficient counting, computational complexity
0 references
0.8243332505226135
0 references
0.7749944925308228
0 references
0.7733232975006104
0 references
