Abstract
We consider the problem of determining whether or not there exists a sparse univariate polynomial that interpolates a given setS={(x i ,y i )} of points. Several important cases are resolved, e.g., the case when thex i's are all positive rational numbers. But the general problem remains open.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Ben-Or and P. Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation,Proc. 20th Ann. ACM Symp. Theory of Computing, 301–309, 1988.
L. Blum, M. Shub and S. Smale, On a theory of computation over the real number; NP completeness, recursive functions and universal machines,Proc. 29th IEEE Symp. Foundations of Comp. Sci., 387–397, 1988.
A. Borodin and P. Tiwari, On the decidability of sparse univariate polynomial interpolation (preliminary version),Proc. 22nd Ann. ACM Symp. Theory of Computing, 535–545, 1990.
R. J. Evans andI. M. Isaacs, Generalized Vandermonde determinants and roots of unity of prime order,Proc. Amer. Math. Soc. 58 (1976), 51–54.
F. R. Gantmacher,The Theory of Matrices, K. A. Hirsch, New York, 1959.
D. Yu. Grigoriev and M. Karpinski, The matching problem for bipartite graphs with polynomially bounded permanents is in NC,Proc. 28th IEEE Symp. Foundations of Comp. Sci., 166–172, 1987.
N. Jacobson,Basic Algebra I, W. H. Freeman and Company, San Francisco, 1974.
M. Karpinski andT. Werther,Learnability and VC-dimension of sparse polynomials and rational functions, Technical Report TR-89060, International Computer Science Institute, Berkeley, 1989.
D. E. Littlewood,The Theory of Group Characters and Matrix Representations of Groups, Oxford, 1950.
M. Marcus andH. Minc,Basic Algebra, A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Boston, Mass., 1964.
J. T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities,J. Assoc. Comput. Mach. 27 (1980), 701–707.
P. Tiwari,Parallel algorithms for instances of linear matroid parity with a small number of solutions, IBM Research Report 12766, IBM T. J. Watson Research Center, New York, 1987.
R. Zippel, Probabilistic algorithms for sparse polynomials.Lecture Notes in Computer Science 72,Symbolic and Algebraic Computation, 216–226, Springer-Verlag, 1979.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Borodin, A., Tiwari, P. On the decidability of sparse univariate polynomial interpolation. Comput Complexity 1, 67–90 (1991). https://doi.org/10.1007/BF01200058
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01200058