Complexity of the Wu-Ritt decomposition

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Complexity of the Wu-Ritt decomposition

Full text

Pdf (1.48 MB)

Source

International Symposium on Parallel Symbolic Computation archive
Proceedings of the second international symposium on Parallel symbolic computation table of contents

Maui, Hawaii, United States

Pages: 139 - 149

Year of Publication: 1997

ISBN:0-89791-951-3

Author

Ágnes Szántó

Cornell University

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 7, Citation Count: 2

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/266670.266716 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.

	1	Michael Ben-Or , Dexter Kozen , John Reif, The complexity of elementary algebra and geometry, Journal of Computer and System Sciences, v.32 n.2, p.251-264, April 1986 [doi>10.1016/0022-0000(86)90029-2]
	2	B. Buchberger , G. E. Collins , B. Kutzler, Algebraic methods for geometric reasoning, Annual review of computer science: vol. 3, 1988, Annual Reviews Inc., Palo Alto, CA, 1988
	3	CHISTOV, A. L. An algorithm of polynomial complexity for factoring polynomials, and determination of the components of n variety in a subexponential time. Zap. Nauchn. Se,. Leningrad. Otdel. Inst. Steklov (LOMI) 137 (1984), 124-188. Russian, English summary.
	4	Claire Dicrescenzo , Dominique Duval, Computations on Curves, Proceedings of the International Symposium on Symbolic and Algebraic Computation, p.100-107, July 09-11, 1984
	5	DICRESCENZO, C., AND DUVAL, D. Algebraic computations on algebraic numbers. In In.formatique et Calcul. Wiley-Masson, 1985, pp. 54-61.
	6	GALLO, G., AND MISHRA, B. Wu-Ritt characteristic sets and their complexity. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6 (1991), 111-136.
	7	GIUSTI, M., AND HEINTZ, J. Algorithmes- disons rnpides - pour la decomposition d'une vari(~t6 aig6brique en composantes irrdductibles et &tuidimensionnelles. In Effective Methods in Algebraic Geometry, T. Morn and C. Trnverso, Eds. Birkh~iuser, 1991, pp. 169-194.
	8	GRIGOR~:V, D. Y. Factoring polynomials over a finite field and solving systems of algebraic equations. Zap. Nauchn. Se,. Leningrad. Otdel. Inst. Steklov (LOMI) 137 (1984), 20-79. Russian, English summary.
	9	HARTSHORNE, R. Algebraic Geometry. Springer- Verlng, 1977.
	10	IERARDI, D., AND KOZEN, D. Parallel resultant computation. In Synthesis of Parallel Algorithms, J. Reif, Ed. Morgan Kauffman, 1993, pp. 679--720.
	11	Douglas John Ierardi, The complexity of quantifier elimination in the theory of an algebraically closed field, 1989
	12	KALKBRENER, M. Algorithmic properties of polynomial rings. Habilitationsschrift.
	13	Michael Kalkbrener, Prime decompositions of radicals in polynomial rings, Journal of Symbolic Computation, v.18 n.4, p.365-372, Oct. 1994 [doi>10.1006/jsco.1994.1052]
	14	Dexter Kozen, Efficient Resolution of Singularities of Plane Curves, Cornell University, Ithaca, NY, 1995
	15	LAZARD, D. Resolution des systemes d'equntions algebriques. Theoret. Comp. Sci. i5, 1 (1981). French, English summary.
	16	RITT, J. F. Differential algebra. American Mathematical Society, 1950.
	17	STURMFELS, B. Sparse elimination theory. In Computational algebraic geometry and commutative algebra, D. Eisenbud and L. Robbiano, Eds. Cambridge, 1991, pp. 264-298.
	18	TEITELBAUM, J. The computational complexity of the resolution of plane curve singularities. Math. Comp. 54 (1990), 797-837.
	19	Joachim von zur Gathen, Parallel algorithms for algebraic problems, SIAM Journal on Computing, v.13 n.4, p.802-824, Nov. 1984 [doi>10.1137/0213050]
	20	Dongming Wang, Irreducible decomposition of algebraic varieties via characteristic sets and Gro¨bner bases, Computer Aided Geometric Design, v.9 n.6, p.471-484, Dec. 1992 [doi>10.1016/0167-8396(92)90045-Q]
	21	WANG) D. Elimination method for mechanical theorem proving in geometries. Annals of Math. and Artificial Intelligence I3 (1995), 1-24.
	22	Wo, W.-T. Basic principles of mechanical theorem proving in elementary geometries. J. Syst. Sci. Math. Sci. 4 (1984), 207-235.

CITED BY 2

	Peter Bürgisser , Peter Scheiblechner, Differential forms in computational algebraic geometry, Proceedings of the 2007 international symposium on Symbolic and algebraic computation, July 29-August 01, 2007, Waterloo, Ontario, Canada
	Peter Bürgisser , Peter Scheiblechner, On the complexity of counting components of algebraic varieties, Journal of Symbolic Computation, v.44 n.9, p.1114-1136, September, 2009