Guaranteed solution formula construction

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Guaranteed solution formula construction

Full text

Pdf (921 KB)

Source

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

Vancouver, British Columbia, Canada

Pages: 137 - 144

Year of Publication: 1999

ISBN:1-58113-073-2

Author

Christopher W. Brown

Department of Computer and Information Sciences, University of Delaware

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): 5, Downloads (12 Months): 11, 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/309831.309890 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	Dennis S. Arnon , George E. Collins , Scott McCallum, Cylindrical algebraic decomposition I: the basic algorithm, SIAM Journal on Computing, v.13 n.4, p.865-877, Nov. 1984 [doi>10.1137/0213054]
	2	George E. Collins, Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, p.134-183, May 20-23, 1975
	3	C, OLLINS: G. E. Quantifier climination by cylindrical algebraic decolnposition- 20 years of progress. In Quantifier Elimination and Cylindrical Algebraic Decomposition (1998), B. Caviness and J. Johnson, Eds., Texts a.ll(l Monographs ill Symbolic Computation, Springer- Verlag.
	4	George E. Collins , Hoon Hong, Partial cylindrical algebraic decomposition for quantifier elimination, Journal of Symbolic Computation, v.12 n.3, p.299-328, Sept. 1991 [doi>10.1016/S0747-7171(08)80152-6]
	5	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	6	Ho~G, H. Improvements in CAD-based Quantifier Elimination. PhD thesis, The Ohio State University, 1990.
	7	Hoon Hong, Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination, Papers from the international symposium on Symbolic and algebraic computation, p.177-188, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143306]
	8	h,'ICCALLUM, S. All improved projection operator for cylindrical algebraic decomposition, hi Quantitier Elimination and Cylindrical Algebraic Decomposition (1998), B. Caviness and J..lohnson. Eds., Texts and Monographs in Symbolic Computation, Springer- Verlag, Vienna.
	9	STURM, W., AND WEISPFENNING, W. Rounding and blending of solids by a real elimination method. In Proc. IMACS World Congress (1997), pp. 727-732.
	10	VVEISPFENNING, V. Quantifier elimination for real algebra the quadratic (:,is(., and beyond. A AECC 8 (1997), 85-101.

CITED BY 4

	George E. Collins , Jeremy R. Johnson , Werner Krandick, Interval arithmetic in cylindrical algebraic decomposition, Journal of Symbolic Computation, v.34 n.2, p.145-157, August 2002
	Christopher W. Brown, QEPCAD B: a program for computing with semi-algebraic sets using CADs, ACM SIGSAM Bulletin, v.37 n.4, December 2003
	Andreas Seidl , Thomas Sturm, A generic projection operator for partial cylindrical algebraic decomposition, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.240-247, August 03-06, 2003, Philadelphia, PA, USA
	Christopher W. Brown , James H. Davenport, The complexity of quantifier elimination and cylindrical algebraic decomposition, Proceedings of the 2007 international symposium on Symbolic and algebraic computation, July 29-August 01, 2007, Waterloo, Ontario, Canada