Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201)

Mathé, Peter; Ritter, Klaus; Traub, Joseph F.

doi:10.4230/DagSemRep.211

Document

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201)

Authors Peter Mathé, Klaus Ritter, 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: 1998-08-11

PDF

File

DagSemRep.211.pdf

Filesize: 285 kB
25 pages

Document Identifiers

DOI: 10.4230/DagSemRep.211
URN: urn:nbn:de:0030-drops-150972

Author Details

Peter Mathé

Klaus Ritter

Joseph F. Traub

Cite As Get BibTex

Peter Mathé, Klaus Ritter, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201). Dagstuhl Seminar Report 211, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1998) https://doi.org/10.4230/DagSemRep.211

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