Pages that link to "Item:Q5454273"
From MaRDI portal
The following pages link to A Primal Barvinok Algorithm Based on Irrational Decompositions (Q5454273):
Displaying 16 items.
- The combinatorics of interval vector polytopes (Q396835) (← links)
- A Euclid style algorithm for MacMahon's partition analysis (Q482232) (← links)
- Symmetrically constrained compositions (Q618862) (← links)
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra (Q695630) (← links)
- Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones. (Q1000914) (← links)
- Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
- Computing with an algebraic-perturbation variant of Barvinok's algorithm (Q1707914) (← links)
- Minkowski length of 3D lattice polytopes (Q1930539) (← links)
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws (Q2325088) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Counting with rational generating functions (Q2474247) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY (Q4911021) (← links)
- Mahonian Partition Identities via Polyhedral Geometry (Q4912512) (← links)
- Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws (Q5050755) (← links)
- Computing Optimized Path Integrals for Knapsack Feasibility (Q5106414) (← links)
