On computations with integer division
Open Access
- 1 January 1989
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 23 (1) , 101-111
- https://doi.org/10.1051/ita/1989230101011
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On the limits of computations with the floor functionInformation and Computation, 1988
- Polynomial time algorithms for finding integer relations among real numbersPublished by Springer Nature ,1986
- Lower bounds for solving linear diophantine equations on random access machinesJournal of the ACM, 1985
- A lower time bound for the knapsack problem on random access machinesActa Informatica, 1983
- Lower bounds for algebraic computation treesPublished by Association for Computing Machinery (ACM) ,1983
- A lower bound of 1/2n2 on linear search programs for the knapsack problemLecture Notes in Computer Science, 1976
- An Introduction to the Geometry of NumbersPublished by Springer Nature ,1959