Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242)

Novak, Erich; Smale, Steve; Traub, Joseph F.

doi:10.4230/DagSemRep.50

Document

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242)

Authors Erich Novak, Steve Smale, 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: 1992-12-03

PDF

File

DagSemRep.50.pdf

Filesize: 4.2 MB
24 pages

Document Identifiers

DOI: 10.4230/DagSemRep.50
URN: urn:nbn:de:0030-drops-149383

Author Details

Erich Novak

Steve Smale

Joseph F. Traub

Cite AsGet BibTex

Erich Novak, Steve Smale, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242). Dagstuhl Seminar Report 50, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1992)
https://doi.org/10.4230/DagSemRep.50

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