Interpolation of sparse rational functions without knowing bounds on exponents

This publication has 10 references indexed in Scilit:

• Improved sparse multivariate polynomial interpolation algorithms
  Published by Springer Nature ,1989
• 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
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• The matching problem for bipartite graphs with polynomially bounded permanents is in NC
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
  Published by Association for Computing Machinery (ACM) ,1986
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• Fast parallel matrix and GCD computations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• Generalized Vandermonde determinants and roots of unity of prime order
  Proceedings of the American Mathematical Society, 1976
• Theory of Non-Commutative Polynomials
  Annals of Mathematics, 1933