License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.04061.2
URN: urn:nbn:de:0030-drops-4994
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/499/
Go to the corresponding Portal

Lickteig, Thomas ; Meer, Klaus ; Pardo, Luis Miguel

04061 Summary -- Real Computation and Complexity

pdf-format:
04061.SWM.Paper.499.pdf (0.2 MB)

Abstract

The seminar "Real Computation and Complexity" was intended as a meeting
place of several tendencies in the complexity analysis of algorithms in real computation.
One main idea therefore was to bring together scientists with rather
different backgrounds such as numerical analysis, symbolic computing, real and
complex algebraic geometry, logic, differential algebra and computational complexity.
This broadness guaranteed to get a thorough overview of current results,
methods and trends in the area. It allowed as well to discuss main problems
related to all aspects of real computation and complexity from different perspectives.

BibTeX - Entry

@InProceedings{lickteig_et_al:DagSemProc.04061.2,
  author =	{Lickteig, Thomas and Meer, Klaus and Pardo, Luis Miguel},
  title =	{{04061 Summary – Real Computation and Complexity}},
  booktitle =	{Real Computation and Complexity},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4061},
  editor =	{Thomas Lickteig and Klaus Meer and Luis Miguel Pardo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/499},
  URN =		{urn:nbn:de:0030-drops-4994},
  doi =		{10.4230/DagSemProc.04061.2},
  annote =	{Keywords: }
}

Collection: 04061 - Real Computation and Complexity
Issue Date: 2006
Date of publication: 13.03.2006

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