License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.83
URN: urn:nbn:de:0030-drops-81416
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8141/
Go to the corresponding LIPIcs Volume Portal

Pagh, Rasmus

Hardness and Approximation of High-Dimensional Search Problems (Invited Talk)

pdf-format:
LIPIcs-MFCS-2017-83.pdf (0.2 MB)

Abstract

Hardness and Approximation of High-Dimensional Search Problems.

BibTeX - Entry

@InProceedings{pagh:LIPIcs:2017:8141,
  author =	{Rasmus Pagh},
  title =	{{Hardness and Approximation of High-Dimensional Search Problems (Invited Talk)}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{83:1--83:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8141},
  URN =		{urn:nbn:de:0030-drops-81416},
  doi =		{10.4230/LIPIcs.MFCS.2017.83},
  annote =	{Keywords: Hardness, high-dimensional search}
}

Keywords: Hardness, high-dimensional search
Collection: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Issue Date: 2017
Date of publication: 01.12.2017

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