LattE
From MaRDI portal
Software:16824
No author found.
Related Items (only showing first 100 items - show all)
Polyhedral omega: a new algorithm for solving linear Diophantine systems ⋮ On the pseudo-periodicity of the integer hull of parametric convex polygons ⋮ Quantifying software reliability via model-counting ⋮ Rational Generating Functions and Integer Programming Games ⋮ Column basis reduction and decomposable knapsack problems ⋮ Computing points of bounded height in projective space over a number field ⋮ On Dedekind's problem for complete simple games ⋮ Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method ⋮ 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 ⋮ Short rational functions for toric algebra and applications ⋮ A Framework for Computing Zeta Functions of Groups, Algebras, and Modules ⋮ Polyhedral star-shaped distributions ⋮ An exact general remeshing scheme applied to physically conservative voxelization ⋮ On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ How to find the convex hull of all integer points in a polyhedron? ⋮ Computing and estimating the volume of the solution space of SMT(LA) constraints ⋮ Computing convex hulls and counting integer points with \texttt{polymake} ⋮ Computation of dilated Kronecker coefficients ⋮ Exact sampling and counting for fixed-margin matrices ⋮ Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients ⋮ Estimating the number of zero-one multi-way tables via sequential importance sampling ⋮ An implicitization challenge for binary factor analysis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Implicitization of curves and (hyper)surfaces using predicted support ⋮ Software for exact integration of polynomials over polyhedra ⋮ The combinatorics of interval vector polytopes ⋮ On the occurrence probability of local binary patterns: a theoretical study ⋮ Symmetrically constrained compositions ⋮ Ehrhart tensor polynomials ⋮ On counterexamples to a conjecture of Wills and Ehrhart polynomials whose roots have equal real parts ⋮ A class of statistical models to weaken independence in two-way contingency tables ⋮ Compactifications of rational maps, and the implicit equations of their images ⋮ Algebraic combinatorics of diametric magic circles ⋮ On Ehrhart polynomials and probability calculations in voting theory ⋮ Low-complexity control of hybrid systems using approximate multi-parametric MILP ⋮ Tropical secant graphs of monomial curves ⋮ Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra ⋮ Integer programming, Barvinok's counting algorithm and Gomory relaxations. ⋮ An example of probability computations under the IAC assumption: the stability of scoring rules ⋮ Roots of Ehrhart polynomials arising from graphs ⋮ A generalization of the integer linear infeasibility problem ⋮ Topics in hyperplane arrangements, polytopes and box-splines ⋮ Exploiting polyhedral symmetries in social choice ⋮ The computation of generalized Ehrhart series in normaliz ⋮ A Euclid style algorithm for MacMahon's partition analysis ⋮ Markov bases for noncommutative Fourier analysis of ranked data ⋮ On spaces of modular forms spanned by eta-quotients ⋮ Computing the integer programming gap ⋮ Enumerating Projections of Integer Points in Unbounded Polyhedra ⋮ Probability calculations under the IAC hypothesis ⋮ FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension ⋮ Integer Programming and Algorithmic Geometry of Numbers ⋮ Counting with rational generating functions ⋮ An approximation algorithm for box abstraction of transition systems on real state spaces ⋮ Ehrhart series and lattice triangulations ⋮ Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra ⋮ Synthetic two-way contingency tables that preserve conditional frequencies ⋮ Armchair or Zigzag? A tool for characterizing graphene edge ⋮ An efficient method to integrate polynomials over polytopes and curved solids ⋮ FPTAS for mixed-integer polynomial optimization with a fixed number of variables ⋮ The partial-fractions method for counting solutions to integral linear systems ⋮ Counting subsets of contingency tables ⋮ On the complexity of computing Kronecker coefficients ⋮ The many aspects of counting lattice points in polytopes ⋮ Sequential importance sampling for multiway tables ⋮ Parametric integer programming algorithm for bilevel mixed integer programs ⋮ Sparsity in sums of squares of polynomials ⋮ Polymake and Lattice Polytopes ⋮ Volume computation for polytopes and partition functions for classical root systems ⋮ Integer Points in Polyhedra — Geometry, Number Theory, Algebra, Optimization ⋮ Short rational generating functions for lattice point problems ⋮ An approximation algorithm for counting contingency tables ⋮ Hybrid schemes for exact conditional inference in discrete exponential families ⋮ Counting integer points in parametric polytopes using Barvinok's rational functions ⋮ On the enumeration of certain weighted graphs ⋮ Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones. ⋮ Computations of volumes and Ehrhart series in four candidates elections ⋮ A generating function for all semi-magic squares and the volume of the Birkhoff polytope ⋮ Rational polyhedral outer-approximations of the second-order cone ⋮ Computing parametric rational generating functions with a primal Barvinok algorithm ⋮ Probabilities of electoral outcomes: from three-candidate to four-candidate elections ⋮ MacMahon partition analysis and the Poincaré series of the algebras of invariants of ternary and quaternary forms ⋮ Polytopes of magic labelings of graphs and the faces of the Birkhoff polytope ⋮ 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 ⋮ On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect ⋮ Ehrhart polynomials of matroid polytopes and polymatroids ⋮ Computing the Continuous Discretely ⋮ Random sampling of contingency tables via probabilistic divide-and-conquer ⋮ Geometric and topological combinatorics. Abstracts from the workshop held January 28 -- February 3, 2007. ⋮ A computational study of integer programming algorithms based on Barvinok's rational functions ⋮ Computing rational powers of monomial ideals ⋮ Computing the integer hull of convex polyhedral sets ⋮ 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 ⋮ Sparse representation of vectors in lattices and semigroups
This page was built for software: LattE
