Pages that link to "Item:Q2406337"
From MaRDI portal
The following pages link to Counting integer points in higher-dimensional polytopes (Q2406337):
Displaying 18 items.
- Counting integer points in polytopes associated with directed graphs (Q288998) (← links)
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes (Q984027) (← links)
- Counting integer points in parametric polytopes using Barvinok's rational functions (Q996707) (← links)
- On integer points in polyhedra (Q1193530) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Counting polytopes via the Radon complex (Q1826858) (← links)
- Counting integer points of flow polytopes (Q2046449) (← links)
- Bounds on Kronecker coefficients via contingency tables (Q2185845) (← links)
- Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← links)
- (Q3360964) (← links)
- Counting the Number of Integral Points in General <i>n</i>-Dimensional Tetrahedra and Bernoulli Polynomials (Q4431201) (← links)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed (Q4698099) (← links)
- Enumerating Collinear Points in Higher Dimensions (Q5089606) (← links)
- Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration (Q5119842) (← links)
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point (Q5265218) (← links)
- Maximum entropy and integer partitions (Q5886264) (← links)
- Durfee squares, symmetric partitions and bounds on Kronecker coefficients (Q6155816) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
