Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9442)

Heinrich, Stefan; Traub, Joseph F.; Wozniakowski, Henryk

doi:10.4230/DagSemRep.101

Document

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9442)

Authors Stefan Heinrich, Joseph F. Traub, Henryk Wozniakowski

Part of: Volume: Dagstuhl Seminar Reports (DagSemRep)
Part of: Series: Dagstuhl Seminar Reports (DagSemRep)
License: Creative Commons Attribution 4.0 International license
Publication Date: 1994-11-09

PDF

File

DagSemRep.101.pdf

Filesize: 277 kB
22 pages

Document Identifiers

DOI: 10.4230/DagSemRep.101
URN: urn:nbn:de:0030-drops-149891

Author Details

Stefan Heinrich

Joseph F. Traub

Henryk Wozniakowski

Cite AsGet BibTex

Stefan Heinrich, Joseph F. Traub, and Henryk Wozniakowski. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9442). Dagstuhl Seminar Report 101, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1994)
https://doi.org/10.4230/DagSemRep.101

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