On Computations with Integer Division
暂无分享,去创建一个
Friedhelm Meyer auf der Heide | Avi Wigderson | Bettina Just | A. Wigderson | Bettina Just | F. Heide
[1] Jeffrey C. Lagarias,et al. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice , 1990, Comb..
[2] Friedhelm Meyer auf der Heide,et al. On the Limits of Computations with the Floor Function , 1988, Inf. Comput..
[3] Jeffrey C. Lagarias,et al. Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers , 1989, STACS.
[4] Friedhelm Meyer auf der Heide,et al. Lower bounds for solving linear diophantine equations on random access machines , 1985, JACM.
[5] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.
[6] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[7] DAVID DOBKIN,et al. A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem , 1978, J. Comput. Syst. Sci..
[8] Richard J. Lipton,et al. A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem , 1976, MFCS.
[9] L. Mordell. Review: J. W. S. Cassels, An introduction to the geometry of numbers , 1961 .
[10] C. A. Rogers,et al. An Introduction to the Geometry of Numbers , 1959 .