QuantLA reading group "The existential theory of the reals"
On Wednesday at 15:00 in Willersbau, room C115.
Meetings
15.03.2017 | Introduction |
29.03.2017 | Resultants and subresultants |
05.04.2017 | The Sturms' method |
12.04.2017 | Tarski's queries |
19.04.2017 | Matrix computation in PolyLog Space |
26.04.2017 | Introduction to semialgebraic geometry - Part 1 |
03.05.2017 | Introduction to semialgebraic geometry - Part 2 |
24.05.2017 | The existential theory of the Reals |
31.05.2017 | Computing with primitive elements - Part 1 |
28.06.2017 | Computing with primitive elements - Part 2 |
28.06.2017 | Application: Robot motion planning problems |
List of papers
[1] John Canny. 1988. Some algebraic and geometric computations in PSPACE. In Proceedings of the twentieth annual ACM symposium on Theory of computing (STOC'88). ACM, New York, NY, USA, 460-467. DOI=http://dx.doi.org/10.1145/62212.62257
[2] Michael Ben-Or, Dexter Kozen, and John Reif. 1984. The complexity of elementary algebra and geometry. In Proceedings of the sixteenth annual ACM symposium on Theory of computing (STOC '84). ACM, New York, NY, USA, 457-464. DOI=http://dx.doi.org/10.1145/800057.808712
[3] L. Csanky. “Fast Parallel Matrix Inversion Algorithms”. In: SIAM Journal on Computing
5.4 (1976), pp. 618–623. doi: 10.1137/0205040.
[4] L. Van den Dries. Tame Topology and O-minimal Structures. 150 184. Cambridge Uni-
versity Press, 1998. isbn: 9780521598385.