Author:
Cheng Qi,Tarasov Sergey P.,Vyalyi Mikhail N.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference24 articles.
1. Allender, E., Bürgisser, P., Kjeldgaard-Pedersen, J., Bro Miltersen, P.: On the complexity of numerical analysis. In: IEEE Conference on Computational Complexity, pp. 331–339 (2006)
2. Bach, E., Shallit, J.: Algorithmic Number Theory, Vol. I: Efficient Algorithms. MIT Press, Cambridge (1996)
3. LNCS;J. Blomer,1998
4. Chen, Z.-Z., Kao, M.-Y.: Reducing randomness via irrational numbers. SIAM J. Comput. 29(4), 1247–1256 (2000)
5. Cheng, Q.: Derandomization of sparse cyclotomic integer zero testing. In: FOCS (2007)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New Bounds on Quotient Polynomials with Applications to Exact Division and Divisibility Testing of Sparse Polynomials;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16
2. Cyclotomic Identity Testing and Applications;Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation;2021-07-18
3. Computing the torsion points of a variety defined by lacunary polynomials;Mathematics of Computation;2012-09-01