Free Access
RAIRO-Theor. Inf. Appl.
Volume 23, Number 1, 1989
Page(s) 101 - 111
Published online 03 February 2017
  1. 1. M. BEN OR, Lower bounds for Algebraic Computation Trees, Proc. 15th ACM STOC, 1983, pp. 80-86. [Google Scholar]
  2. 2. L. BABAI, B. JUST and F. MEYER AUF DER HEIDE, On the Limits of Computations with the Floor Functions, Information and Computation, 78 (2), 1988, pp. 99-107. [MR: 955578] [Zbl: 0659.68051] [Google Scholar]
  3. 3. J. W. S. CASSELS, An Introduction to the Geometry of Numbers, Springer, Berlin, 1959; second printing, 1971. [MR: 306130] [Zbl: 0086.26203] [Google Scholar]
  4. 4. D. DOBKIN and R. LIPTON, A Lower Bound of 1/2n2 on Linear Search Programs for the Knapsack Problem, J..C.S.S., Vol. 16, 1975, pp. 417-421. [Zbl: 0397.68045] [Google Scholar]
  5. 5. J. HASTAD, B. JUST,J. LAGARIAS and C. P. SCHNORR, Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers, Proc. STACS, 1986, pp. 105-118. [MR: 827729] [Zbl: 0606.68033] [Google Scholar]
  6. 6. P. KLEIN and F. MEYER AUF DER HEIDE, A Lower Bound for the Knapsack Problem on Random Access Machines, Act. Inf., Vol. 19, 1983, pp. 385-395. [MR: 717993] [Zbl: 0515.68037] [Google Scholar]
  7. 7. H. W. Jr LENSTRA, Integer Programming with a Fixed Number of Variables, Report 81-03, Mathematisch Instituut, Amsterdam, 1983. [MR: 727410] [Google Scholar]
  8. 8. J. C. LAGARIAS, H. W. Jr. LENSTRA and C. P. SCHNORR, Karkine-Zolotareff Bases and Successive Minima of a Latice and its Reciprocla Lattice, preprint 1986. [Google Scholar]
  9. 9. F. MEYER AUF DER HEIDE, Lower Bounds for Solving Linear Diophantine equations on Random Acces Machines, J.ACM., Vol. 32 (4), 1985, pp. 929-937. [MR: 810344] [Zbl: 0633.68031] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.