Asymptotic acceleration of solving multivariate polynomial systems of equations

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	W, Auzlnger and H,$, Stetter. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations, In Proc. Intern. Conf. on Numerical Math., volume 86 of htt. Series of Numerical Math, pages 11-30. Blrkhauser, 1988,
	2	Dario Bini , Victor Y. Pan, Polynomial and matrix computations (vol. 1): fundamental algorithms, Birkhauser Verlag, Basel, Switzerland, 1994
	3	John F. Canny , Ioannis Z. Emiris, An Efficient Algorithm for the Sparse Mixed Resultant, Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.89-104, May 10-14, 1993
	4	.I'.E Cardinal. On two iterative methods for approximating the roots of a polynomial. In J. Renegar, M. Shub, and S. Smale, editors, Proc. AMS-SIAM Summer Seminar on Math. of Numerical Analysis, (Park City, Utah, 1995), volume 32 of Lectures in Applied Math., pages 165--188. Am. Math. Soe. Press, 1996.
	5	J.P. Cardinal and B. Mourrain. Algebraic approach of residues and applications. In J. Reneger, M. Shub, and S. Smale, editors, Proc. AM$.SIAM Summer Seminar on Math. of Numerical Analysis, (Park City, Utah, 1995), volume 32 of Lectures in Applied Math., pages 189--210. Am. Math. Soc. Press, 1996.
	6	M. Elkadi and B. Mourrain. Approche Effective des R~sidus Alg6briques. Rapport de Recherche 2884, INRIA, 1996.
	7	Ioannis Z. Emiris , Ashutosh Rege, Monomial bases and polynomial system solving (extended abstract), Proceedings of the international symposium on Symbolic and algebraic computation, p.114-122, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190374]
	8	Ioanis Z. Emiris , Victor Y. Pan, The structure of sparse resultant matrices, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.189-196, July 21-23, 1997, Kihei, Maui, Hawaii, United States [doi>10.1145/258726.258779]
	9	I.M. Gelfand, M.M. Kapranov, and A.V. Zelevinsky. Discriminants, Resultants and Multidimensional Determinants. Birkhiiuser, Boston-Basel-Berlin, 1994.
	10	Peter Henrici , William R. Kenan, Applied & computational complex analysis: power series integration conformal mapping location of zero, John Wiley & Sons, Inc., New York, NY, 1988
	11	D.Kapur and Y.N. Laks~an. Elimination methods: an introducton. In B. Donald, D. Kaput, and J. Mundy, editors, $ymbolic and Numerical Computation for Artifitial Intellingence, pages 45--89. Academic Press, New York, 1992.
	12	ES. Macaulay. Some formulae in elimination. Prec. London Math. 5oc., 1(33):3-27, 1902.
	13	F.S. Macaulay. The Algebraic Theory of Modular Systems. Cambridge Univ. Press, 1916.
	14	B. Mourrain. Solving polynomial systems by matrix computations. Preprint, submitted, 1997.
	15	B. Mourrain and V. Y. Pan. Multidimensional structured matrices and polynomial systems. Calcolo, (Special Issue, Workshop on Toeplitz Matrices: Structure, Algorithms and Applications), 33:389--401, 1997.
	16	Bernard Mourrain , Victor Y. Pan, Solving special polynomial systems by using structured matrices and algebraic residues, Selected papers of a conference on Foundations of computational mathematics, p.287-304, September 1997, Rio de Janeiro, Brazil
	17	B. Mourrain and V.Y. Pan. Multivariate polynomials, duality and structured matrices. Preprint, submitted for publication, 1997.
	18	Victor Y. Pan, Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.741-750, May 29-June 01, 1995, Las Vegas, Nevada, United States [doi>10.1145/225058.225292]
	19	V.Y. Pan. Optimal and nearly optimal algorithms for appro.v,imating complex polynomial zeros. Computers and Math. Appls., 31(12):97-138, 1996.
	20	Victor Y. Pan, Solving a Polynomial Equation: Some History and Recent Progress, SIAM Review, v.39 n.2, p.187-220, June 1997 [doi>10.1137/S0036144595288554]
	21	P. S. Pedersen and B. $turmfels. Product formulas for resul. tents and Chow forms. Math. Zeitschrift, 214:377-396, 1993.
	22	James Renegar, On the worst-case arithmetic complexity of approximating zeros of systems of polynomials, SIAM Journal on Computing, v.18 n.2, p.350-370, April 1989 [doi>10.1137/0218024]
	23	James Renegar, On the worst-case arithmetic complexity of approximating zeros of polynomials, Journal of Complexity, v.3 n.2, p.90-113, June 1987 [doi>10.1016/0885-064X(87)90022-7]
	24	B.L. Van der Waerden. Modern Algebra, Vol. II. Frederick Ungar Publishing Co, 1948.