On computations with integer division

DOI10.1051/ITA/1989230101011MaRDI QIDQ3816971zbMATH OpenOpenAlexFDO

Authors Bettina Just, Friedhelm Meyer auf der Heide, A. Wigderson

Publication date 1989

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92319

zbMATH Keywords

arithmetical progressioncomputation treesinteger divisioninteger points in high-dimensional convex sets

Mathematics Subject Classification ID

Geometry of numbers (11H99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4072374
• scientific article; zbMATH DE number 512852
• Computational divided differencing and divided-difference arithmetics
• scientific article; zbMATH DE number 1254004
• Integer division in residue number systems
• scientific article; zbMATH DE number 4144051
• Computing Division Polynomials
• scientific article; zbMATH DE number 4009638

Cites work

• A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
• A lower time bound for the knapsack problem on random access machines
• An Introduction to the Geometry of Numbers
• scientific article; zbMATH DE number 3980478 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Lower bounds for solving linear diophantine equations on random access machines
• On the limits of computations with the floor function

Cited in

(6)

• On Faster Integer Calculations Using Non-arithmetic Primitives
• scientific article; zbMATH DE number 1254004 (Why is no real title available?)
• The Mathematics of the Pentium Division Bug
• Integer division in residue number systems
• Lower bounds on algebraic random access machines
• Computability in linear algebra

This page was built for publication: On computations with integer division

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