Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. Irreducible polynomials with integral coefficients have succinet certificates;Cantor;J. Algorithms,1981
2. Computers and Intractability;Garey,1979
3. Transcendental and Algebraic Numbers;Gel'fond,1960
4. A Hadamard-type bound on the coefficients of a determinant of polynomials;Goldstein;SIAM Rev.,1974
5. On the complexity of factoring polynomials with integer coefficients;Kaltofen,1982
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献