Computational Complexity of Sparse Real Algebraic Function Interpolation

This publication has 10 references indexed in Scilit:

• Interpolation of sparse rational functions without knowing bounds on exponents
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Computational Complexity of Sparse Rational Interpolation
  SIAM Journal on Computing, 1994
• Existence of short proofs for nondivisibility of sparse polynomials under the extended Riemann hypothesis
  Published by Association for Computing Machinery (ACM) ,1992
• 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
• Sur la complexité du principe de Tarski-Seidenberg
  Bulletin de la Société Mathématiques de France, 1990
• Solving systems of polynomial inequalities in subexponential time
  Journal of Symbolic Computation, 1988
• A deterministic algorithm for sparse multivariate polynomial interpolation
  Published by Association for Computing Machinery (ACM) ,1988
• On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Foundations of Algebraic Topology
  Published by Walter de Gruyter GmbH ,1952