On computing sparse shifts for univariate polynomials
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Algorithms for computing sparse shifts for multivariate polynomials
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Hiding program slices for software security
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
On reducing a system of equations to a single equation
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Interpolation of depth-3 arithmetic circuits with two multiplication gates
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On exact and approximate interpolation of sparse rational functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Sparse interpolation of multivariate rational functions
Theoretical Computer Science
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis
Fundamenta Informaticae
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
| Hi-index | 0.00 |
The authors analyze the computational complexity of sparse rational interpolation, and give the first deterministic algorithm for this problem with singly exponential bounds on the number of arithmetic operations.