skip to main content
poster

On the representation of constructible sets

Published: 06 February 2009 Publication History

Abstract

No abstract available.

References

[1]
E. Bach, J. R. Driscoll, and J. Shallit. Factor refinement. In SODA, pages 201--211, 1990.
[2]
F. Boulier, F. Lemaire, and M. Moreno Maza. Well known theorems on triangular systems and the D5 principle. In Proc. of Transgressive Computing, Spain, 2006.
[3]
C. Chen, O. Golubitsky, F. Lemaire, M. Moreno Maza, and W. Pan. Comprehensive Triangular Decomposition, volume 4770 of LNCS, pages 73--101. Springer Verlag, 2007.
[4]
C. Chen, F. Lemaire, L. Li, M. Moreno Maza, W. Pan and Y. Xie. The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in MAPLE. In Proc. CASA'08.
[5]
X. Dahan, M. Moreno Maza, É. Schost, and Y. Xie. On the complexity of the D5 principle. In Proc. of Transgressive Computing, Spain, 2006.
[6]
J. Della Dora, C. Dicrescenzo, and D. Duval. About a new method for computing in algebraic number fields. In Proc. EUROCAL 85 Vol. 2, volume 204 of LNCS, pages 289--290. Springer-Verlag, 1985.
[7]
J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
[8]
H. Hong. Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination. In Proc. ISSAC'92, pg. 177--188.
[9]
X. Li, M. Moreno Maza, and R. Rasheed. Fast arithmetic and modular techniques for polynomial gcds modulo regular chains, 2008. Preprint.
[10]
R. Rioboo and M. Moreno Maza. Polynomial GCD computations over towers of algebraic extensions. In Proc. AAECC-11, pages 365--382, 1995.
[11]
M. Manubens and A. Montes. Minimal canonical comprehensive Gröbner system, 01-12-06. arXiv:math.AC/0611948.

Cited By

View all
  • (2024)Comprehensive LU Decomposition and True Path2024 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)10.1109/SYNASC65383.2024.00016(17-24)Online publication date: 16-Sep-2024

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Communications in Computer Algebra
ACM Communications in Computer Algebra  Volume 42, Issue 3
September 2008
80 pages
ISSN:1932-2232
EISSN:1932-2240
DOI:10.1145/1504347
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 February 2009
Published in SIGSAM-CCA Volume 42, Issue 3

Check for updates

Qualifiers

  • Poster

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Comprehensive LU Decomposition and True Path2024 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)10.1109/SYNASC65383.2024.00016(17-24)Online publication date: 16-Sep-2024

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media