On computations with integer division

DOI10.1051/ita/1989230101011zbMath0665.68027OpenAlexW220172787MaRDI QIDQ3816971

Friedhelm Meyer auf der Heide, Avi Wigderson, Bettina Just

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

integer divisioncomputation treesarithmetical progressioninteger points in high-dimensional convex sets

Mathematics Subject Classification ID

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

Related Items (3)

On Faster Integer Calculations Using Non-arithmetic Primitives ⋮ Lower bounds on algebraic random access machines ⋮ Computability in linear algebra

Cites Work

• Unnamed Item
• A lower time bound for the knapsack problem on random access machines
• On the limits of computations with the floor function
• A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
• Integer Programming with a Fixed Number of Variables
• An Introduction to the Geometry of Numbers
• Lower bounds for solving linear diophantine equations on random access machines

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