swMATH4654MaRDI QIDQ16824FDOQ16824
Author name not available (Why is that?)
Official website: https://www.math.ucdavis.edu/~latte/
Cited In (only showing first 100 items - show all)
- MacMahon partition analysis and the Poincaré series of the algebras of invariants of ternary and quaternary forms
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- Computations of volumes and Ehrhart series in four candidates elections
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Petri Net Reductions for Counting Markings
- Armchair or Zigzag? A tool for characterizing graphene edge
- Exploiting polyhedral symmetries in social choice
- On the pseudo-periodicity of the integer hull of parametric convex polygons
- Quantifying software reliability via model-counting
- Using invariants for phylogenetic tree construction
- Polyhedral star-shaped distributions
- On counterexamples to a conjecture of Wills and Ehrhart polynomials whose roots have equal real parts
- Column basis reduction and decomposable knapsack problems
- Compactifications of rational maps, and the implicit equations of their images
- Roots of Ehrhart polynomials arising from graphs
- Algebraic combinatorics of diametric magic circles
- Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones.
- Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- Random sampling of contingency tables via probabilistic divide-and-conquer
- Counting integral points in polytopes via numerical analysis of contour integration
- Volume computation for polytopes and partition functions for classical root systems
- Representation-compatible power indices
- Local Euler-Maclaurin expansion of Barvinok valuations and Ehrhart coefficients of a rational polytope
- Probabilities of electoral outcomes: from three-candidate to four-candidate elections
- Enumerating projections of integer points in unbounded polyhedra
- An extension of Wilf's conjecture to affine semigroups
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- The partial-fractions method for counting solutions to integral linear systems
- Rational generating functions and integer programming games
- An example of probability computations under the IAC assumption: the stability of scoring rules
- Computing the integer hull of convex polyhedral sets
- The probability of majority inversion in a two-stage voting system with three states
- Polytopes of magic labelings of graphs and the faces of the Birkhoff polytope
- An efficient method to integrate polynomials over polytopes and curved solids
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- Linear and Integer Programming vs Linear Integration and Counting
- On lattice point counting in \(\varDelta\)-modular polyhedra
- A computational study of integer programming algorithms based on Barvinok's rational functions
- A class of statistical models to weaken independence in two-way contingency tables
- Counting with rational generating functions
- Counting integer points in parametric polytopes using Barvinok's rational functions
- The computation of generalized Ehrhart series in normaliz
- Low-complexity control of hybrid systems using approximate multi-parametric MILP
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- A Euclid style algorithm for MacMahon's partition analysis
- On spaces of modular forms spanned by eta-quotients
- Short rational functions for toric algebra and applications
- A generalization of the integer linear infeasibility problem
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Computing topological zeta functions of groups, algebras, and modules. I
- FPTAS for mixed-integer polynomial optimization with a fixed number of variables
- A framework for computing zeta functions of groups, algebras, and modules
- An approximation algorithm for counting contingency tables
- CoLoMoTo
- ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
- Integer programming and algorithmic geometry of numbers
- Ehrhart polynomials of matroid polytopes and polymatroids
- An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
- On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
- The combinatorics of interval vector polytopes
- Exact sampling and counting for fixed-margin matrices
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- On the enumeration of certain weighted graphs
- Ehrhart tensor polynomials
- Computing algebraic numbers of bounded height
- Sparsity in sums of squares of polynomials
- The complexity of generating functions for integer points in polyhedra and beyond
- Topics in hyperplane arrangements, polytopes and box-splines
- Polymake and Lattice Polytopes
- Implicitization of curves and (hyper)surfaces using predicted support
- On the complexity of computing Kronecker coefficients
- Integer Polynomial Optimization in Fixed Dimension
- Enumeration of Totally Real Number Fields of Bounded Root Discriminant
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
- Computing the integer programming gap
- TrIm
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points
- Computing convex hulls and counting integer points with \texttt{polymake}
- Markov bases for noncommutative Fourier analysis of ranked data
- cdd
- FEXACT
- The many aspects of counting lattice points in polytopes
- Sequential importance sampling for multiway tables
- Normaliz
- polymake
- AS 51
- lp_solve
- JavaView
- lpSolve
- 4ti2
- cddplus
- azove
- lrs
- barvinok
- ELIAS
- TOPCOM
- TRIP
This page was built for software: LattE
