A practical method for the sparse resultant

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A practical method for the sparse resultant

Full text

Pdf (937 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1993 international symposium on Symbolic and algebraic computation table of contents

Kiev, Ukraine

Pages: 183 - 192

Year of Publication: 1993

ISBN:0-89791-604-2

Authors

Ioannis Emiris
John Canny

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 14, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/164081.164122 What is a DOI?

REFERENCES

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.

	Ber75	D.N. Bernstein. The number of roots of a system of equations. Funktszonal'nyz Anahz Ego Pmlozheniya, 9(3):1-4, aul-Sep 1975.
	BGW88	C. Bajaj, T. Garrity, and a. Warren. On the applications of multi-equational resultants. Technical Report 826, Purdue Univ., 1988.
	Can88	John F. Canny, The complexity of robot motion planning, MIT Press, Cambridge, MA, 1988
	CE93	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
	Cha92	M. Chardin. The resultant via a Koszul complex. In F. Eyssette and A. Galligo, editors, Proc. of MEGA '92, pages 29-39, Nice, April 1992.
	EC92	Ioannis Emiris , John Canny, An efficient approach to removing geometric degeneracies, Proceedings of the eighth annual symposium on Computational geometry, p.74-82, June 10-12, 1992, Berlin, Germany [doi>10.1145/142675.142694]
	HS92	B. Huber and B. Sturmfels. Homotopies preserving the Newton polytopes. Manuscript, Cornel Univ., presented at the "Workshop on Real Algebraic Geometry", August 1992.
	Kho78	A.G. Khovanskii. Newton polyhedra, a.nd the genus of complete intersections. Funkts,tonal'- nyi Anahz z Ego Pr, lozhenzya, 12(1)'51-61, Jan-Mar 1978.
	KSZ92	M.M. Kapranov, B. Sturmfels, and A.V. Zelevinsky. Chow polytopes and general resultants. Duke Math. J., 67:237-254, 1992.
	Kus75	A.G. Kushnirenko. The Newton polyhedron and the number of solutions of a system of k equations in k unknowns. Uspekh~ Mal. Nauk., 30:266-267, 1975.
	Laz81	D. Lazard. R~solution des syst~mes d'dquations alg~briques. Theor. Co~np. Scence, 15:77-110, 1981.
	Mac02	F.S. Macaulay. Some formulaein elimination. Proc. London Math. Soc., 1(33)'3-27, 1902.
	Mah92	E. Mahalingam. A way to compute mixed volumes. Master's thesis, UC Berkeley, October 1992.
	MC92a	Dinesh Manocha , John F. Canny, Implicit representation of rational parametric surfaces, Journal of Symbolic Computation, v.13 n.5, p.485-510, May 1992
	MC92b	Dinesh Manocha , John F. Canny, Multipolynomial resultants and linear algebra, Papers from the international symposium on Symbolic and algebraic computation, p.158-167, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143300]
	MC92c	D. Manocha and J. Canny. Real time inverse kinematics for general 6R manipulators. In Proc. IEEE I~tern. Conf. Robotzcs and Aulomat~on, Nice, May 1992.
	PS91	P. Pedersen and B. Sturmfels. Product formulas for sparse resultants. Ma.nuscript, Cornell Univ., 1991.
	Sal85	G. Salmon. Modern H~.gher Algebra. G.E. Stechert and Co., New York, 1885. reprinted 1924.
	Sch80	J. T. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the ACM (JACM), v.27 n.4, p.701-717, Oct. 1980 [doi>10.1145/322217.322225]
	Stu91	B. Sturmfels. Sparse elimination theory. In D. Eisenbud and L. Robbiano, editors, Proc. Computat. Algebraic Geom. and Commut. Algebra, Cortona, Italy, June 1991. Cambridge Univ. Press. To appear.
	Stu92	B. Sturmfels. Combinatorics of the sparse resultant. Technical Report 020-93, MSRI, Berkeley, November 1992.
	SZ	B. Sturmfels and A. Zelevinsky. Multigraded resultants of Sylvester type. J. of Algebra. To appear. Also, Manuscript, Cornell Univ., i991.
	vdW50	B.L. van der Waerden. Modern Algebra. Ungar Publishing Co., New York, 3rd edition, 1950.

CITED BY 4

	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
	Ming-Deh A. Huang , Ashwin J. Rao, A black box approach to the algebraic set decomposition problem, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.497-506, May 24-26, 1998, Dallas, Texas, United States
	Deepak Kapur , Tushar Saxena, Comparison of various multivariate resultant formulations, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.187-194, July 10-12, 1995, Montreal, Quebec, Canada
	Robert J. Holt , Arun N. Netravali, Uniqueness of Solutions to Three Perspective Views of Four Points, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.3, p.303-307, March 1995