Lecture notes on complexity of quantifier elimination over the reals
History and Overview
2021-12-02 v1 Symbolic Computation
Logic
Abstract
These are lecture notes for a course I gave in mid-1990s for MSc students at the University of Bath. It presents an algorithm with singly exponential complexity for the existential theory of the reals, in the spirit of J. Renegar. The aim was to convey the main underlying ideas, so many of the proofs and finer details of algorithms are either missing or just sketched. I changed nothing in the original notes except adding references, bibliography, and correcting obvious typos.
Keywords
Cite
@article{arxiv.2112.00456,
title = {Lecture notes on complexity of quantifier elimination over the reals},
author = {Nicolai Vorobjov},
journal= {arXiv preprint arXiv:2112.00456},
year = {2021}
}
Comments
21 pages