Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. L. Adleman, On breaking the iterated Merkle—Hellman public key cryptosystem,Proc. 15th ACM Symp. on Theory of Computing, Boston (1983), 402–412.
2. J. W. S. Cassels,An introduction to the geometry of numbers, Springer, New York, (1971).
3. P. van Emde Boas, Another NP-complete partition problem and the complexity of computing short vectors in a lattice,Rep. MI/UVA 81-04, Amsterdam (1981).
4. M. Grötschel, L. Lovász andA. Schrijver, The ellipsoid method and its consequences in combinatorial optimization,Combinatorica 1 (1981), 186–197.
5. Proc. Silver Jubilee Conf. on Comb., Univ. Waterloo;M. Grötschel,1984
Cited by
567 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献