Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401)

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

doi:10.4230/DagSemRep.356

Document

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401)

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

Part of: Volume: Dagstuhl Seminar Reports (DagSemRep)
Part of: Series: Dagstuhl Seminar Reports (DagSemRep)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2003-03-26

PDF

File

DagSemRep.356.pdf

Filesize: 240 kB
18 pages

Document Identifiers

DOI: 10.4230/DagSemRep.356
URN: urn:nbn:de:0030-drops-152361

Author Details

Leszek Plakote

Klaus Ritter

Ian H. Sloan

Joseph F. Traub

Cite As Get 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

0

Metadata Views

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail