Pages that link to "Item:Q4361783"
From MaRDI portal
The following pages link to On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension (Q4361783):
Displaying 15 items.
- Bias expansion of spatial statistics and approximation of differenced lattice point counts (Q353996) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Computing the Ehrhart polynomial of a convex lattice polytope (Q1330880) (← links)
- Computing with an algebraic-perturbation variant of Barvinok's algorithm (Q1707914) (← links)
- On the complexity of computing Kronecker coefficients (Q2012174) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- The many aspects of counting lattice points in polytopes (Q2491985) (← links)
- A computational study of integer programming algorithms based on Barvinok's rational functions (Q2568332) (← links)
- Counting lattice vectors (Q2643017) (← links)
- Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
