Pages that link to "Item:Q5704153"
From MaRDI portal
The following pages link to On Counting Integral Points in a Convex Rational Polytope (Q5704153):
Displaying 7 items.
- Solving the knapsack problem via \(\mathbb Z\)-transform (Q1870019) (← links)
- Polyhedral omega: a new algorithm for solving linear Diophantine systems (Q2363492) (← links)
- A discrete Farkas lemma (Q2386214) (← links)
- The many aspects of counting lattice points in polytopes (Q2491985) (← links)
- COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS (Q3112587) (← links)
- Computing Optimized Path Integrals for Knapsack Feasibility (Q5106414) (← links)
- Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration (Q5119842) (← links)