A zero-test and an interpolation algorithm for the shifted sparse polynomials

This publication has 8 references indexed in Scilit:

• Complexity of quantifier elimination in the theory of algebraically closed fields
  Published by Springer Nature ,2005
• Computational Complexity of Sparse Real Algebraic Function Interpolation
  Published by Springer Nature ,1993
• Fewnomials
  Published by American Mathematical Society (AMS) ,1991
• The interpolation problem for k-sparse sums of eigenfunctions of operators
  Advances in Applied Mathematics, 1991
• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
  SIAM Journal on Computing, 1990
• A deterministic algorithm for sparse multivariate polynomial interpolation
  Published by Association for Computing Machinery (ACM) ,1988
• The matching problem for bipartite graphs with polynomially bounded permanents is in NC
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Definability and fast quantifier elimination in algebraically closed fields
  Theoretical Computer Science, 1983