On the implementation of CGS real QE

Ryoya Fukasaku, Hidenao Iwane, Yosuke Sato

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)


A CGS real QE method is a real quantifier elimination (QE) method which is composed of the computation of comprehensive Gröbner systems (CGSs) based on the theory of real root counting. Its fundamental algorithm was first introduced by Weispfenning in 1998. We further improved the algorithm in 2015 so that we can make a satisfactorily practical implementation. For its efficient implementation, there are several key issues we have to take into account. In this extended abstract we introduce them together with some important techniques for making an efficient CGS real QE implementation.

Original languageEnglish
Title of host publicationMathematical Software - 5th International Conference, ICMS 2016, Proceedings
EditorsGert-Martin Greuel, Andrew Sommese, Thorsten Koch, Peter Paule
PublisherSpringer Verlag
Number of pages8
ISBN (Print)9783319424316
Publication statusPublished - 2016
Externally publishedYes
Event5th International Conference on Mathematical Software, ICMS 2016 - Berlin, Germany
Duration: Jul 11 2016Jul 14 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other5th International Conference on Mathematical Software, ICMS 2016

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'On the implementation of CGS real QE'. Together they form a unique fingerprint.

Cite this