Clustering in the Lazard method for Cylindrical Algebraic Decomposition

Research output: Contribution to journalArticlepeer-review

17 Downloads (Pure)

Abstract

Cylindrical Algebraic Decomposition (CAD) is an algorithm originally proposed by Collins in [4]. Given a set of multivariate polynomials, CAD decomposes the multidimensional real space into connected subsets called cells, within which those polynomials are sign-invariant.
Original languageEnglish
Pages (from-to)126-129
Number of pages4
JournalACM Communications in Computer Algebra
Volume57
Issue number3
DOIs
Publication statusPublished - 13 Dec 2023

Bibliographical note

Copyright © 2023 Copyright is held by the owner/author(s)

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Keywords

  • Cylindrical algebraic decomposition

Fingerprint

Dive into the research topics of 'Clustering in the Lazard method for Cylindrical Algebraic Decomposition'. Together they form a unique fingerprint.

Cite this