DagRep.5.6.28.pdf
- Filesize: 1.08 MB
- 20 pages
Document
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 5, Issue 6
Volume: Dagstuhl Reports, Volume 5
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-01-11
Cite AsGet BibTex
Peter Bürgisser, Felipe Cucker, Marek Karpinski, and Nicolai Vorobjov. Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). In Dagstuhl Reports, Volume 5, Issue 6, pp. 28-47, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/DagRep.5.6.28
https://doi.org/10.4230/DagRep.5.6.28
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15242
"Complexity of Symbolic and Numerical Problems".
Keywords
- Symbolic computation
- Algorithms in real algebraic geometry
- Complexity lower bounds
- Geometry of numerical algorithms
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads