On QE Algorithms over an Algebraically Closed Field Based on Comprehensive Gröbner Systems

Ryoya Fukasaku, Shutaro Inoue, Yosuke Sato

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


We introduce new algorithms for quantifier eliminations (QE) in the domain of an algebraically closed field. Our algorithms are based on the computation of comprehensive Gröbner systems (CGS). We study Suzuki–Sato’s CGS computation algorithm and its successors in more detail and modify them into an optimal form for applying to QE. Based on this modified algorithm, we introduce two QE algorithms. One is pursuing the simplest output quantifier free formula which employs only the computations of CGS. The other consists of parallel computations of CGS and GCD of parametric unary polynomials. It achieves faster computation time with reasonably simple output quantifier free formulas. Our implementation shows that in many examples our algorithms are superior to other existing algorithms such as a QE algorithm adopted in the Mathematica package Reduce and Resolve or a QE algorithm adopted in the Maple package Projection which are the most efficient existing implementations as far as we know.

Original languageEnglish
Pages (from-to)267-281
Number of pages15
JournalMathematics in Computer Science
Issue number3
Publication statusPublished - Oct 1 2015
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'On QE Algorithms over an Algebraically Closed Field Based on Comprehensive Gröbner Systems'. Together they form a unique fingerprint.

Cite this