Fast Unimodular Counting

DOI10.1017/S0963548300004193zbMath0973.90052WikidataQ128253233 ScholiaQ128253233MaRDI QIDQ4500424

John A. Mount

Publication date: 30 January 2001

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

zbMATH Keywords

complexitynumber of nonnegative integer solutions

Mathematics Subject Classification ID

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

Related Items

Effective lattice point counting in rational convex polytopes, Exact sampling and counting for fixed-margin matrices, The Ehrhart polynomial of the Birkhoff polytope, Approximating the volume of tropical polytopes is difficult