Simultaneous Diophantine approximation of rationals by rationals
暂无分享,去创建一个
[1] Adi Shamir,et al. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1984, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[2] Jeffrey C. Lagarias. The Computational Complexity of Simultaneous Diophantine Approximation Problems , 1985, SIAM J. Comput..
[3] Jeffrey C. Lagarias,et al. Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem , 1984, ICALP.
[4] N. B. Slater,et al. Gaps and steps for the sequence nθ mod 1 , 1967, Mathematical Proceedings of the Cambridge Philosophical Society.
[5] John H. Halton. The distribution of the sequence { n ξ}( n = 0, 1, 2, …) , 1965 .
[6] Jeffrey C. Lagarias,et al. Best simultaneous Diophantine approximations. II. Behavior of consecutive best approximations , 1982 .