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

Author Rasmus Pagh



PDF
Thumbnail PDF

File

LIPIcs.MFCS.2017.83.pdf
  • Filesize: 248 kB
  • 1 pages

Document Identifiers

Author Details

Rasmus Pagh

Cite AsGet BibTex

Rasmus Pagh. Hardness and Approximation of High-Dimensional Search Problems (Invited Talk). In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, p. 83:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.MFCS.2017.83

Abstract

Hardness and Approximation of High-Dimensional Search Problems.
Keywords
  • Hardness
  • high-dimensional search

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail