LattE
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones.
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Polytopes of magic labelings of graphs and the faces of the Birkhoff polytope
- Ehrhart polynomials of matroid polytopes and polymatroids
- Geometric and topological combinatorics. Abstracts from the workshop held January 28 -- February 3, 2007.
- cdd
- FEXACT
- Normaliz
- polymake
- CoLoMoTo
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- AS 51
- lp_solve
- JavaView
- lpSolve
- Representation-compatible power indices
- An extension of Wilf's conjecture to affine semigroups
- The probability of majority inversion in a two-stage voting system with three states
- 4ti2
- Polyhedral star-shaped distributions
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- cddplus
- azove
- Ehrhart tensor polynomials
- lrs
- TOPCOM
- barvinok
- ELIAS
- The partial-fractions method for counting solutions to integral linear systems
- Sparsity in sums of squares of polynomials
- TRIP
- Hybrid schemes for exact conditional inference in discrete exponential families
- Mgfun
- PARTITIONS
- Unimodularity
- On the occurrence probability of local binary patterns: a theoretical study
- Tropical secant graphs of monomial curves
- PrefLib
- Convex
- An efficient method to integrate polynomials over polytopes and curved solids
- On the complexity of computing Kronecker coefficients
- CaTS
- Rational polyhedral outer-approximations of the second-order cone
- RunLim
- Computing rational powers of monomial ideals
- NZMATH
- Computing the integer hull of convex polyhedral sets
- Sparse representation of vectors in lattices and semigroups
- On lattice point counting in -modular polyhedra
- How to find the convex hull of all integer points in a polyhedron?
- PermLib
- SymPol
- PolyLib
- edgecount
- An approximation algorithm for box abstraction of transition systems on real state spaces
- Counting subsets of contingency tables
- Computations of volumes and Ehrhart series in four candidates elections
- Probabilities of electoral outcomes: from three-candidate to four-candidate elections
- Advanced SMT techniques for weighted model integration
- Quantitative static analysis of communication protocols using abstract Markov chains
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- On Dedekind's problem for complete simple games
- Omega
- Computing convex hulls and counting integer points with \texttt{polymake}
- Computation of dilated Kronecker coefficients
- Polyhedra
- Nauty
- Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
- On Ehrhart polynomials and probability calculations in voting theory
- Exploiting polyhedral symmetries in social choice
- SMAPO
- Markov bases for noncommutative Fourier analysis of ranked data
- Computing the integer programming gap
- Probability calculations under the IAC hypothesis
- Counting with rational generating functions
- Unimodularity Test
- The many aspects of counting lattice points in polytopes
- Sequential importance sampling for multiway tables
- Volume computation for polytopes and partition functions for classical root systems
- Zeta
- A computational study of integer programming algorithms based on Barvinok's rational functions
- Cobra
- AS 144
- AS 159
- Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method
- Short rational functions for toric algebra and applications
- VoxelPipe
- gllm
- nsgtree
- Rational generating functions and integer programming games
- Nyx
- REMAP3D
- ZOBOV
- 2HOT
- An approximation algorithm for counting contingency tables
- respol
- MacMahon partition analysis and the Poincaré series of the algebras of invariants of ternary and quaternary forms
This page was built for software: LattE
