Fast Unimodular Counting

DOI10.1017/S0963548300004193MaRDI QIDQ4500424zbMATH OpenWikidataFDO

Authors John A. Mount

Publication date 30 January 2001

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548300004193

zbMATH Keywords

complexitynumber of nonnegative integer solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• Algebraic unimodular counting
• A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
• Sampling contingency tables

Cited in

(11)

• The Ehrhart polynomial of the Birkhoff polytope
• Effective lattice point counting in rational convex polytopes
• Fast, flexible MUS enumeration
• A counting problem in linear programming
• Exact sampling and counting for fixed-margin matrices
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
• Approximating the volume of tropical polytopes is difficult
• Smoothed counting of 0–1 points in polyhedra
• k-leaky double Hurwitz descendants
• The constant term algebra of type A: the structure
• Counting solutions to binomial complete intersections

This page was built for publication: Fast Unimodular Counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500424)