Abstract
We provide an alternative algorithm for counting lattice points in the convex polytope {x ∈ ℝn ∣ Ax = b, x ≥ 0}. It is based on an exact (tractable) formula for the case A ∈ ℤm×(m+1) that we repeatedly use for the general case A ∈ ℤm×n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
