Quantifier elimination for formulas constrained by quadratic equations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Quantifier elimination for formulas constrained by quadratic equations

Full text

Pdf (710 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: 264 - 274

Year of Publication: 1993

ISBN:0-89791-604-2

Author

Hoon Hong

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 7, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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.164140 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 Soule Arnon, Algorithms for the geometry of semi-algebraic sets, 1981
	2	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]
	3	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
	4	Alain Colmerauer, An introduction to Prolog III, Communications of the ACM, v.33 n.7, p.69-90, July 1990 [doi>10.1145/79204.79210]
	5	N. Fitchas, A. Galligo, and J. Morgenstern. Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed" fields. Journal of Pure and Applied Algebra, (67):1- 14, 1990.
	6	D. Yu. Grigor'ev, Complexity of deciding Tarski algebra, Journal of Symbolic Computation, v.5 n.1-2, p.65-108, February/April 1988 [doi>10.1016/S0747-7171(88)80006-3]
	7	J. Heintz, M-F. Roy, and P. SolernS. On the complexity of semialgebraic sets. In Proc. IFIP, pages 293-298, 1989.
	8	Hoon Hong , George E. Collins, Improvements in cad-based quantifier elimination, 1990
	9	H. Hong. Comparison of several decision algorithms for the existential theory of the reals. Technical Report 91-41.0, Research Institute for Symbolic Computation, Johannes Kepler University A- 4040 Linz, Austria, 1991.
	10	H. Hong. Half resultant. Technical Report 92- 51, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1992.
	11	Hoon Hong, Non-linear Real Constraints in Constraint Logic Programming, Proceedings of the Third International Conference on Algebraic and Logic Programming, p.201-212, September 02-04, 1992
	12	It. Hong. Slope resultant. Technical Report 92- 52, Research Institute for Symbolic Computation, johannes Kepler University A-4040 Linz, Austria, 1992.
	13	J. Jaffar , J.-L. Lassez, Constraint logic programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.111-119, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41635]
	14	R. Loos and V. Weispfenning. Applying linear quantifier elimination. Manuscript in preparation, 1992.
	15	Scott McCallum, An improved projection operation for cylindrical algebraic decomposition (computer algebra, geometry, algorithms), 1984
	16	:i. Renegar. On the computational complexity and geometry of the first-order theory of the reals (part III). Technical Report 856, Cornell University, Ithaca, New York 14853-7501 USA, August 1989.
	17	A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, second edition, 1951.
	18	Volker Weispfenning, The complexity of linear problems in fields, Journal of Symbolic Computation, v.5 n.1-2, p.3-27, February/April 1988 [doi>10.1016/S0747-7171(88)80003-8]

CITED BY 3

	Luca Gemignani, GCD of polynomials and Bezout matrices, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.271-277, July 21-23, 1997, Kihei, Maui, Hawaii, United States
	Hoon Hong, Heuristic search and pruning in polynomial constraints satisfaction, Annals of Mathematics and Artificial Intelligence, v.19 n.3-4, p.319-334, 1997
	Andreas Dolzmann , Oliver Gloor , Thomas Sturm, Approaches to parallel quantifier elimination, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.88-95, August 13-15, 1998, Rostock, Germany