Pages that link to "Item:Q2643564"
From MaRDI portal
The following pages link to Effective lattice point counting in rational convex polytopes (Q2643564):
Displaying 50 items.
- LattE (Q16824) (← links)
- Exact sampling and counting for fixed-margin matrices (Q366999) (← links)
- The combinatorics of interval vector polytopes (Q396835) (← links)
- An example of probability computations under the IAC assumption: the stability of scoring rules (Q449045) (← links)
- A Euclid style algorithm for MacMahon's partition analysis (Q482232) (← links)
- Synthetic two-way contingency tables that preserve conditional frequencies (Q537425) (← links)
- Armchair or Zigzag? A tool for characterizing graphene edge (Q538582) (← links)
- Symmetrically constrained compositions (Q618862) (← links)
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra (Q695630) (← links)
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope (Q735404) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
- On the pseudo-periodicity of the integer hull of parametric convex polygons (Q831988) (← links)
- Quantifying software reliability via model-counting (Q832053) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- Ehrhart series and lattice triangulations (Q958233) (← links)
- On the enumeration of certain weighted graphs (Q997075) (← links)
- Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
- Integer programming, Barvinok's counting algorithm and Gomory relaxations. (Q1417591) (← links)
- Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
- Ehrhart tensor polynomials (Q1688870) (← links)
- Computing with an algebraic-perturbation variant of Barvinok's algorithm (Q1707914) (← links)
- On the occurrence probability of local binary patterns: a theoretical study (Q1932861) (← links)
- On the complexity of computing Kronecker coefficients (Q2012174) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- Rational polyhedral outer-approximations of the second-order cone (Q2042079) (← links)
- Computing rational powers of monomial ideals (Q2100043) (← links)
- Computing the integer hull of convex polyhedral sets (Q2109987) (← links)
- Sparse representation of vectors in lattices and semigroups (Q2118144) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
- An approximation algorithm for box abstraction of transition systems on real state spaces (Q2248056) (← links)
- Probabilities of electoral outcomes: from three-candidate to four-candidate elections (Q2300612) (← links)
- Quantitative static analysis of communication protocols using abstract Markov chains (Q2322314) (← links)
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws (Q2325088) (← links)
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points (Q2351749) (← links)
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases (Q2355167) (← links)
- Polyhedral omega: a new algorithm for solving linear Diophantine systems (Q2363492) (← links)
- On Dedekind's problem for complete simple games (Q2376066) (← links)
- Computation of dilated Kronecker coefficients (Q2399866) (← links)
- Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients (Q2408938) (← links)
- On Ehrhart polynomials and probability calculations in voting theory (Q2426958) (← links)
- Computing the integer programming gap (Q2460632) (← links)
- Probability calculations under the IAC hypothesis (Q2463576) (← links)
- Counting with rational generating functions (Q2474247) (← 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)
- Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method (Q2633263) (← links)
- Short rational functions for toric algebra and applications (Q2643547) (← links)
- MacMahon partition analysis and the Poincaré series of the algebras of invariants of ternary and quaternary forms (Q3090726) (← links)
