scientific article; zbMATH DE number 3924871

MaRDI QIDQ3699762zbMATH OpenFDO

Authors L. Ya. Zamanskij, V. L. Cherkasskij

Publication date 1985

zbMATH Keywords

divide-and- conquer algorithmnumber of integral points in polyhedrapolynomial algorithm

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Lattices and convex bodies (number-theoretic aspects) (11H06) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• scientific article; zbMATH DE number 3910134
• Computing the volume, counting integral points, and exponential sums
• scientific article; zbMATH DE number 1405493
• Computing the integer points of a polyhedron. I: Algorithm

Cited in

(3)

• scientific article; zbMATH DE number 3910134 (Why is no real title available?)
• Counting the Number of Integral Points in General n-Dimensional Tetrahedra and Bernoulli Polynomials
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed

This page was built for publication:

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