Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)

Authors Peter Bürgisser, Felipe Cucker, Marek Karpinski, Nicolai Vorobjov and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.5.6.28.pdf
  • Filesize: 1.08 MB
  • 20 pages

Document Identifiers

Author Details

Peter Bürgisser
Felipe Cucker
Marek Karpinski
Nicolai Vorobjov
and all authors of the abstracts in this report

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

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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail