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


Plakote, Leszek ; Ritter, Klaus ; Sloan, Ian H. ; Traub, Joseph F.
Weitere Beteiligte (Hrsg. etc.): Leszek Plakote and Klaus Ritter and Ian H. Sloan and Joseph F. Traub

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401)

pdf-format:
DagSemRep-356.pdf (0.2 MB)


BibTeX - Entry

@TechReport{plakote_et_al:DagSemRep.356,
  author =	{Plakote, Leszek and Ritter, Klaus and Sloan, Ian H. and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401)}},
  pages =	{1--18},
  ISSN =	{1619-0203},
  year =	{2003},
  type = 	{Dagstuhl Seminar Report},
  number =	{356},
  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/15236},
  URN =		{urn:nbn:de:0030-drops-152361},
  doi =		{10.4230/DagSemRep.356},
}

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


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