Sparse Interpolation of Symmetric Polynomials

Advances in Applied Mathematics

Volumn 18, Issue 3, 1997, Pages 271-285

  Barvinok, Alexander ^a   Fomin, Sergey ^b,c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c ST PETERSBURG INSTITUTE FOR INFORMATICS AND AUTOMATION   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038875817     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.1996.0508     Document Type: Article

References (9)

1. Aho A. V., Hopcroft J. E., Ullman J. D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading.
2. M. Ben-Or, P. Tiwari, 1988, A deterministic algorithm for sparse multivariate polynomial interpolation, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, ACM, New York.
3. Csanky L. Fast parallel matrix inversion algorithms. SIAM J. Comput. 5:1976;618-823.
4. Emelichev V. A., Kovalev M. M., Kravtsov M. K. Polytopes, Graphs and Optimization. 1984;Cambridge University Press.
5. Grigoriev D. Yu., Karpinski M., Singer M. F. The interpolation problem fork. Adv. in Appl. Math. 12:1991;76-81.
6. James G. D. The Representation Theory of the Symmetric Group. Lecture Notes in Math. 682:1978;Springer-Verlag, Berlin.
7. MacDonald I. G. Symmetric Functions and Hall Polynomials. 1995;Oxford University Press.
8. Remmel J., Whitney R. Multiplying Schur functions. J. Algorithms. 5:1984;471-487.
9. Schwartz J. T. Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27:1980;701-717.