A deterministic algorithm for sparse multivariate polynomial interpolation

Authors:
Michael Ben-Or;Prasoon Tiwari
Affiliations:
Hebrew University, Jerusalem, Israel;IBM Thomas J Watson Research Center
Venue:
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Year:
1988

Citing 4
Cited 79

Finding irreducible polynomials over finite fields

STOC '86 Proceedings of the eighteenth 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
The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents is in $NC$

The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents is in $NC$

Solving systems of nonlinear polynomial equations faster

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Interpolating polynomials from their values

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Modular rational sparse multivariate polynomial interpolation

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
On the decidability of sparse univariate polynomial interpolation

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Effective Noether irreducibility forms and applications

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Parallel multiplication and powering of polynomials

Journal of Symbolic Computation
Algorithms for sparse rational interpolation

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Efficient techniques for multipolynomial resultant algorithms

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Learning arithmetic read-once formulas

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The inverse of an automorphism in polynomial time

Journal of Symbolic Computation
Multipolynomial resultants and linear algebra

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Learning sparse multivariate polynomials over a field with queries and counterexamples

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Occam's razor for functions

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On learning arithmetic read-once formulas with exponentiation (extended abstract)

COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On computing sparse shifts for univariate polynomials

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Dagwood: a system for manipulating polynomials given by straight-line programs

ACM Transactions on Mathematical Software (TOMS)
Algorithms for computing sparse shifts for multivariate polynomials

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
On computing greatest common divisors with polynomials given by black boxes for their evaluations

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
A note on learning multivariate polynomials under the uniform distribution (extended abstract)

COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On feasible multivariate polynomial interpolations over arbitrary fields

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Interpolation of sparse multivariate polynomials over large finite fields with applications

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Learning functions represented as multiplicity automata

Journal of the ACM (JACM)
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm

ISSAC '00 Proceedings of the 2000 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
Symbolic and numeric methods for exploiting structure in constructing resultant matrices

Journal of Symbolic Computation
East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters

ACM SIGSAM Bulletin
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields

IEEE Transactions on Computers
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Tellegen's principle into practice

ISSAC '03 Proceedings of the 2003 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
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the complexities of multipoint evaluation and interpolation

Theoretical Computer Science
Symbolic-numeric sparse interpolation of multivariate polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Simulation-Based Functional Test Generation for Embedded Processors

IEEE Transactions on Computers
An efficient technique for synthesis and optimization of polynomials in GF(2m)

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Interpolation of depth-3 arithmetic circuits with two multiplication gates

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields

IEEE Transactions on Computers
From quotient-difference to generalized eigenvalues and sparse polynomial interpolation

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Solving toeplitz- and vandermonde-like linear systems with large displacement rank

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On exact and approximate interpolation of sparse rational functions

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
ISSAC 2007 poster abstracts

ACM Communications in Computer Algebra
Read-once polynomial identity testing

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness-randomness tradeoffs for bounded depth arithmetic circuits

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On lacunary polynomial perfect powers

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Solving structured linear systems with large displacement rank

Theoretical Computer Science
A new algorithm for sparse interpolation of multivariate polynomials

Theoretical Computer Science
Deterministically testing sparse polynomial identities of unbounded degree

Information Processing Letters
Property Testing: A Learning Theory Perspective

Foundations and Trends® in Machine Learning
Symbolic-numeric sparse interpolation of multivariate polynomials

Journal of Symbolic Computation
Interpolation of polynomials given by straight-line programs

Theoretical Computer Science
Improved Polynomial Identity Testing for Read-Once Formulas

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Special issue computational algebraic complexity editorial

Journal of Symbolic Computation - Special issue on computational algebraic complexity
The ideal membership problem and polynomial identity testing

Information and Computation
Extracting a simplified view of design functionality based on vector simulation

HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
The monomial ideal membership problem and polynomial identity testing

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Parallel sparse polynomial interpolation over finite fields

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
A local decision test for sparse polynomials

Information Processing Letters
Applications of FFT and structured matrices

Algorithms and theory of computation handbook
Enumeration of the monomials of a polynomial and related complexity classes

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Arithmetic Circuits: A survey of recent results and open questions

Foundations and Trends® in Theoretical Computer Science
Reconstructing sparse trigonometric functions

ACM Communications in Computer Algebra
On sparse interpolation over finite fields

ACM Communications in Computer Algebra
Black-box identity testing of depth-4 multilinear circuits

Proceedings of the forty-third annual ACM symposium on Theory of computing
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter

Proceedings of the forty-third annual ACM symposium on Theory of computing
Diversification improves interpolation

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Detecting lacunary perfect powers and computing their roots

Journal of Symbolic Computation
New Techniques for the Computation of Linear Recurrence Coefficients

Finite Fields and Their Applications
On the bit-complexity of sparse polynomial and series multiplication

Journal of Symbolic Computation
Representation of sparse Legendre expansions

Journal of Symbolic Computation
Extracting sparse factors from multivariate integral polynomials

Journal of Symbolic Computation
Implicitization of curves and (hyper)surfaces using predicted support

Theoretical Computer Science
Structured FFT and TFT: symmetric and lattice polynomials

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation

Theory of Computing Systems
A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.01

Visualization

Abstract

An efficient deterministic polynomial time algorithm is developed for the sparse polynomial interpolation problem. The number of evaluations needed by this algorithm is very small. The algorithm also has a simple NC implementation.