Irreducibility of multivariate polynomials
Journal of Computer and System Sciences
Factoring sparse multivariate polynomials
Journal of Computer and System Sciences
Numerical recipes: the art of scientific computing
Numerical recipes: the art of scientific computing
Computing with polynomials given by straight-line programs I: greatest common divisors
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
ACM '73 Proceedings of the ACM annual conference
Newton's iteration and the sparse Hensel algorithm (Extended Abstract)
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Factoring sparse multivariate polynomials
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Modular rational sparse multivariate polynomial interpolation
ISSAC '90 Proceedings of the 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
Multipolynomial resultants and linear algebra
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Tlisp: a concurrent Lisp for the transputers
ACM SIGSAM Bulletin
On Hensel construction of eigenvalues and eigenvectors of matrices with polynomial entries
ISSAC '93 Proceedings of the 1993 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
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
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
FOXBOX: a system for manipulating symbolic objects in black box representation
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On feasible multivariate polynomial interpolations over arbitrary fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
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
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
IEEE Transactions on Computers
Classifying Isomorphic Residue Classes
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Hiding program slices for software security
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Tellegen's principle into practice
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Reed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
Computer algebra handbook
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
On the complexities of multipoint evaluation and interpolation
Theoretical Computer Science
Algorithms for the non-monic case of the sparse modular GCD algorithm
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Probabilistic algorithms for computing resultants
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Symbolic-numeric sparse interpolation of multivariate polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A block Wiedemann rank algorithm
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Simulation-Based Functional Test Generation for Embedded Processors
IEEE Transactions on Computers
Structured matrices in the application of bivariate interpolation to curve implicitization
Mathematics and Computers in Simulation
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
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
Solving structured linear systems with large displacement rank
Theoretical Computer Science
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
Proceedings of the 2009 international symposium on Symbolic and algebraic 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
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
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
Diversification improves interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Extracting sparse factors from multivariate integral polynomials
Journal of Symbolic Computation
Implicitization of curves and (hyper)surfaces using predicted support
Theoretical Computer Science
Sparse multivariate function recovery from values with noise and outlier errors
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
| Hi-index | 0.01 |
A fundamental technique used by many algorithms in computer algebrais interpolating polynomials from their values. This paper discusses two algorithms for solving this problem for sparse multivariate polynomials, an updated version of a probabilistic one and a new deterministic technique that uses some ideas due to Ben-Or and Tiwari (1988). In addition algorithms are presented for quickly finding points that are not zeroes of sparse multivariate polynomials-the zero avoidance problem.