License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemRep.211
URN: urn:nbn:de:0030-drops-150972
URL: https://drops.dagstuhl.de/opus/volltexte/2021/15097/
 


Mathé, Peter ; Ritter, Klaus ; Traub, Joseph F.
Weitere Beteiligte (Hrsg. etc.): Peter Mathé and Klaus Ritter and Joseph F. Traub

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201)

pdf-format:
DagSemRep-211.pdf (0.3 MB)


BibTeX - Entry

@TechReport{mathe_et_al:DagSemRep.211,
  author =	{Math\'{e}, Peter and Ritter, Klaus and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201)}},
  pages =	{1--25},
  ISSN =	{1619-0203},
  year =	{1998},
  type = 	{Dagstuhl Seminar Report},
  number =	{211},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/15097},
  URN =		{urn:nbn:de:0030-drops-150972},
  doi =		{10.4230/DagSemRep.211},
}

Collection: Dagstuhl Seminar Reports
Issue Date: 2021
Date of publication: 11.08.1998


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI