An Improved Projection for Cylindrical Algebraic Decomposition

D. Lazard

Chapter 29 in Algebraic Geometry and its Applications, 1994, pp 467-476 from Springer

Abstract: Abstract It is proved that the projection needed by the CAD algorithm needs only to compute the resultants, the discriminants, the leading coefficients and the constant coefficients of the input polynomials, provided they have be made square—free and relatively prime by GCD computations. This improves [7] first improvement by removing any dimension condition and dropping out from the projection set all coefficients of the input polynomials, other than the leading and the constant ones.

Keywords: Algebraic Closure; Improve Projection; Univariate Polynomial; Quantifier Elimination; Real Close Field (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2628-4_29

Ordering information: This item can be ordered from
http://www.springer.com/9781461226284

DOI: 10.1007/978-1-4612-2628-4_29

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().