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


Novak, Erich ; Smale, Steve ; Traub, Joseph F.
Weitere Beteiligte (Hrsg. etc.): Erich Novak and Steve Smale and Joseph F. Traub

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242)

pdf-format:
DagSemRep-50.pdf (4 MB)


BibTeX - Entry

@TechReport{novak_et_al:DagSemRep.50,
  author =	{Novak, Erich and Smale, Steve and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242)}},
  pages =	{1--24},
  ISSN =	{1619-0203},
  year =	{1992},
  type = 	{Dagstuhl Seminar Report},
  number =	{50},
  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/14938},
  URN =		{urn:nbn:de:0030-drops-149383},
  doi =		{10.4230/DagSemRep.50},
}

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


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