A faster algorithm for counting the integer points number in \(\Delta \)-modular polyhedra (Q6642664)
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 faster algorithm for counting the integer points number in \(\Delta \)-modular polyhedra |
scientific article; zbMATH DE number 7948685
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster algorithm for counting the integer points number in \(\Delta \)-modular polyhedra |
scientific article; zbMATH DE number 7948685 |
Statements
A faster algorithm for counting the integer points number in \(\Delta \)-modular polyhedra (English)
0 references
25 November 2024
0 references
integer linear programming
0 references
short rational generating function
0 references
bounded sub-determinants
0 references
multidimensional knapsack problem
0 references
subset-sum problem
0 references
counting problem
0 references
