Abstract
Since the late eighties, the Macaulay matrix has recently received renewed attention in the field of quantifier elimination. Grigor’ev (1988) and Renegar (1992a, 1992b, 1992c) made it a central tool in their study of the complexity of quantifier elimination. They developed algorithms which have better complexities than Collins’ quantifier elimination algorithm based on the CAD (Collins 1975), but until now Collins’ CAD is much faster in practice.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag/Wien
About this paper
Cite this paper
Hagel, G. (1998). Characterizations of the Macaulay Matrix and Their Algorithmic Impact. In: Caviness, B.F., Johnson, J.R. (eds) Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9459-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-7091-9459-1_15
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82794-9
Online ISBN: 978-3-7091-9459-1
eBook Packages: Springer Book Archive