Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators-Reference-Cited by-同舟云学术

Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators

Published:1990-03 Issue:3 Volume:9 Page:301-320
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Kaltofen Erich,Trager Barry M.

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference33 articles.

1. The complexity of partial derivatives;Baur;Theoretical Comp. Sci.,1983

2. A deterministic algorithm for sparse multivariate polynomial interpolation;Ben-Or,1988

3. The Complexity of Robot Motion Planning;Canny,1988

4. Solving systems of non-linear polynomial equations faster;Canny,1989

5. A taxonomy of problems with fast parallel algorithms;Cook;Inf. Control,1985

Cited by 90 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hitting Sets for Orbits of Circuit Classes and Polynomial Families;ACM Transactions on Computation Theory;2024-09-10

2. Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization;Information and Computation;2024-09

3. Encounters in Symbolic Computation: Ideas for the Ages;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

4. A New Sparse Polynomial GCD by Separating Terms;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

5. Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10