Search Results

---

Abstract

---

Cite as

Leszek Plakote, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401). Dagstuhl Seminar Report 356, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)

---

Copy BibTex To Clipboard

@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/entities/document/10.4230/DagSemRep.356},
  URN =		{urn:nbn:de:0030-drops-152361},
  doi =		{10.4230/DagSemRep.356},
}

@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/entities/document/10.4230/DagSemRep.356}, URN = {urn:nbn:de:0030-drops-152361}, doi = {10.4230/DagSemRep.356}, }