Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401)

Authors Leszek Plakote, Klaus Ritter, Ian H. Sloan, Joseph F. Traub



PDF
Thumbnail PDF

File

DagSemRep.356.pdf
  • Filesize: 240 kB
  • 18 pages

Document Identifiers

Author Details

Leszek Plakote
Klaus Ritter
Ian H. Sloan
Joseph F. Traub

Cite AsGet BibTex

Leszek Plakote, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401). Dagstuhl Seminar Report 356, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)
https://doi.org/10.4230/DagSemRep.356

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