Publisher
Springer Science and Business Media LLC
Subject
Information Systems,Computer Science (miscellaneous)
Reference18 articles.
1. Garey M R and Johnson D S, Computer and Intractability: A Guide to the Theory of NP-Completeness, Freeman W H and San Francisco, 1979.
2. Lenstra A K, Lenstra Jr H W, and Lovász L, Factoring polynomials with rational coefficients, Mathematische Ann., 1982, 261: 513–534.
3. Schnorr C P, A hierarchy of polynomial lattice basis reduction algorithms, Theoretical Computer Science, 1987, 53: 201–224.
4. Schnorr C P and Euchner M, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Mathematics of Programming, 1994, 66: 181–199.
5. Feng Y, Wu W Y, Zhang J Z, and Chen J W, Exact bivariate polynomial factorization over Z by approximation of roots, Journal of Systems Science and Complexity, 2015, 28(1): 243–260.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献