On the decidability of sparse univariate polynomial interpolation

Authors:
A. Borodin;P. Tiwari
Affiliations:
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY;Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY
Venue:
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Year:
1990

A deterministic algorithm for sparse multivariate polynomial interpolation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation

Learning arithmetic read-once formulas

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
Polynomial bounds for VC dimension of sigmoidal neural networks

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Hi-index	0.00