License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.2.9.200
URN: urn:nbn:de:0030-drops-38920
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/3892/
Go back to Dagstuhl Reports

Keller, Alexander ; Kuo, Frances ; Neuenkirch, Andreas ; Traub, Joseph F.
Weitere Beteiligte (Hrsg. etc.): Alexander Keller and Frances Kuo and Andreas Neuenkirch and Joseph F. Traub

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)

pdf-format:
dagrep_v002_i009_p200_s12391.pdf (0.9 MB)

Abstract

From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar can be found in this report. The
first section describes the seminar topics and goals in general. Links to
extended abstracts or full papers are provided, if available.

BibTeX - Entry

@Article{keller_et_al:DR:2013:3892,
  author =	{Alexander Keller and Frances Kuo and Andreas Neuenkirch and Joseph F. Traub},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)}},
  pages =	{200--225},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{9},
  editor =	{Alexander Keller and Frances Kuo and Andreas Neuenkirch and Joseph F. Traub},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/3892},
  URN =		{urn:nbn:de:0030-drops-38920},
  doi =		{10.4230/DagRep.2.9.200},
  annote =	{Keywords: Computational complexity of continuous problems, Partial information, Biomedical learning problems, Random media, Computational finance, Noisy data, }
}

Keywords: Computational complexity of continuous problems, Partial information, Biomedical learning problems, Random media, Computational finance, Noisy data,
Freie Schlagwörter (englisch): Tractability, Quantum computation, Computational stochastic processes, High-dimensional problems
Collection: Dagstuhl Reports, Volume 2, Issue 9
Issue Date: 2013
Date of publication: 20.02.2013

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