Work

Faster one block quantifier elimination for regular polynomial systems of equations

Year: 2021
Type: preprint
Abstract: Quantifier elimination over the reals is a central problem incomputational real algebraic geometry, polynomial system solving andsymbolic computation. Given a semi-algebraic formula (whose atoms arepolynomial constraints) with quantifiers on some variables, itconsists in computing a logically equivalent formula involving onlyunquantified variables. When there is no alternate of quantifier, onehas a one block quantifier elimination problem.This paper studies a variant of the one block quantifierelimination in which we compute an almost equivalent formula of theinput. We design a new probabilistic efficient algorithm for solvingthis variant when the input is a system of polynomial equationssatisfying some regularity assumptions. When the input is generic,involves $s$ polynomials of degree bounded by $D$ with $n$ quantifiedvariables and $t$ unquantified ones, we prove that this algorithmoutputs semi-algebraic formulas of degree bounded by $\\mathcal{D}$using $O\\ {\\widetilde{~}}\\left (n\\ 8^{t}\\ \\mathcal{D}^{3t+2}\\ \\binom{t+\\mathcal{D}}{t} \\right )$ arithmetic operations inthe ground field where $\\mathcal{D} =n\\ D^s(D-1)^{n-s+1}\\ \\binom{n}{s}$.In practice, it allows us to solve quantifier elimination problemswhich are out of reach of the state-of-the-art (up to $8$ variables).
Source: HAL
Language: English
Open Access status: green
OpenAlex ID: W3181793692
Cites: 48
Cited by: 3
Related to: 10