Simplification of truth-invariant cylindrical algebraic decompositions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Simplification of truth-invariant cylindrical algebraic decompositions

Full text

Pdf (295 KB)

Source

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

Rostock, Germany

Pages: 295 - 301

Year of Publication: 1998

ISBN:1-58113-002-3

Author

Christopher W. Brown

Department of Computer and Information Sciences, University of Delaware

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
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): 5, Citation Count: 3

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/281508.281652 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	BROWN, C. W., AND COLLINS, G. E. Simple truth invariant CAD's and solution formula construction. Tech. Rep. 96-19, Research Institute for Symbolic Computation (RISC-Linz), 1996.
	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	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]
	4	Andreas Dolzmann , Thomas Sturm, Simplification of quantifier-free formulae over ordered fields, Journal of Symbolic Computation, v.24 n.2, p.209-231, August 1997 [doi>10.1006/jsco.1997.0123]
	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	Hoon Hong , George E. Collins, Improvements in cad-based quantifier elimination, 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	KAHAN, W. Problem no. 9: An ellipse problem. SIGSAM Bulletin of the Assoc. Comp. Mach. 9, 35 (1975), 11.
	9	Scott McCallum, An Improved Projection Operation for Cylindrical Algebraic Decomposition, Research Contributions from the European Conference on Computer Algebra-Volume 2, p.277-278, April 01-03, 1985

CITED BY 3

	Andreas Dolzmann , Volker Weispfenning, Local quantifier elimination, Proceedings of the 2000 international symposium on Symbolic and algebraic computation, p.86-94, July 2000, St. Andrews, Scotland
	Christopher W. Brown, Improved projection for cylindrical algebraic decomposition, Journal of Symbolic Computation, v.32 n.5, p.447-465, November 2001
	Christopher W. Brown, QEPCAD B: a program for computing with semi-algebraic sets using CADs, ACM SIGSAM Bulletin, v.37 n.4, December 2003