INVESTIGADORES
PERRUCCI Daniel Roberto
artículos
Título:
Elementary recursive quantifier elimination based on Thom encoding and sign determination
Autor/es:
DANIEL PERRUCCI; MARIE-FRANCOISE ROY
Revista:
ANNALS OF PURE AND APPLIED LOGIC
Editorial:
ELSEVIER SCIENCE BV
Referencias:
Lugar: Amsterdam; Año: 2017
ISSN:
0168-0072
Resumen:
We describe a new quantifier elimination algorithm for real closed fields based onThom encoding and sign determination. The complexity of this algorithm is elemen-tary recursive and its proof of correctness is completely algebraic. In particular, thenotion of connected components of semialgebraic sets is not used.
