Improving a CGS-QE Algorithm

DOI10.1007/978-3-319-32859-1_20zbMath1460.13051OpenAlexW2489359915MaRDI QIDQ2807840

Yosuke Sato, Hidenao Iwane, Ryoya Fukasaku

Publication date: 25 May 2016

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_20

zbMATH Keywords

comprehensive Gröbner systemDescartes' ruleQE

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (4)

CGSQE/SyNRAC ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases ⋮ Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1 ⋮ On the Implementation of CGS Real QE

This page was built for publication: Improving a CGS-QE Algorithm