License
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.5.6.28
URN: urn:nbn:de:0030-drops-55066
URL: http://drops.dagstuhl.de/opus/volltexte/2016/5506/
Go back to Dagstuhl Reports


Bürgisser, Peter ; Cucker, Felipe ; Karpinski, Marek ; Vorobjov, Nicolai
Weitere Beteiligte (Hrsg. etc.): Peter Bürgisser and Felipe Cucker and Marek Karpinski and Nicolai Vorobjov

Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)

pdf-format:
dagrep_v005_i006_p028_s15242.pdf (1 MB)


Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 15242 "Complexity of Symbolic and Numerical Problems".

BibTeX - Entry

@Article{brgisser_et_al:DR:2016:5506,
  author =	{Peter B{\"u}rgisser and Felipe Cucker and Marek Karpinski and Nicolai Vorobjov},
  title =	{{Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)}},
  pages =	{28--47},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{6},
  editor =	{Peter B{\"u}rgisser and Felipe Cucker and Marek Karpinski and Nicolai Vorobjov},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5506},
  URN =		{urn:nbn:de:0030-drops-55066},
  doi =		{10.4230/DagRep.5.6.28},
  annote =	{Keywords: Symbolic computation, Algorithms in real algebraic geometry, Complexity lower bounds, Geometry of numerical algorithms}
}

Keywords: Symbolic computation, Algorithms in real algebraic geometry, Complexity lower bounds, Geometry of numerical algorithms
Seminar: Dagstuhl Reports, Volume 5, Issue 6
Issue Date: 2016
Date of publication: 11.01.2016


DROPS-Home | Fulltext Search | Imprint Published by LZI