Fast Unimodular Counting

From MaRDI portal

Revision as of 07:47, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4500424

Jump to:navigation, search

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

complexity number of nonnegative integer solutions

Mathematics Subject Classification ID

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

Related Items (4)

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

This page was built for publication: Fast Unimodular Counting

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4500424&oldid=18591037"