| dc.creator | Perrucci, Daniel Roberto | |
| dc.creator | Roy, Marie Françoise | |
| dc.date.accessioned | 2022-06-08T17:52:09Z | |
| dc.date.accessioned | 2022-10-15T13:05:39Z | |
| dc.date.available | 2022-06-08T17:52:09Z | |
| dc.date.available | 2022-10-15T13:05:39Z | |
| dc.date.created | 2022-06-08T17:52:09Z | |
| dc.date.issued | 2017-08 | |
| dc.identifier | Perrucci, Daniel Roberto; Roy, Marie Françoise; Elementary recursive quantifier elimination based on Thom encoding and sign determination; Elsevier Science; Annals Of Pure And Applied Logic; 168; 8; 8-2017; 1588-1604 | |
| dc.identifier | 0168-0072 | |
| dc.identifier | http://hdl.handle.net/11336/159267 | |
| dc.identifier | CONICET Digital | |
| dc.identifier | CONICET | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/4389351 | |
| dc.description.abstract | 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. | |
| dc.language | eng | |
| dc.publisher | Elsevier Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1016/j.apal.2017.03.001 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0168007217300325 | |
| dc.rights | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
| dc.rights | info:eu-repo/semantics/restrictedAccess | |
| dc.subject | QUANTIFIER ELIMINATION | |
| dc.subject | SIGN DETERMINATION | |
| dc.subject | THOM ENCODING | |
| dc.title | Elementary recursive quantifier elimination based on Thom encoding and sign determination | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
