文章基本信息
- 标题：Hardness and Approximation of High-Dimensional Search Problems (Invited Talk)
- 本地全文：下载
- 作者：Rasmus Pagh
- 期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
- 电子版ISSN：1868-8969
- 出版年度：2017
- 卷号：83
- 页码：83:1-83:1
- DOI：10.4230/LIPIcs.MFCS.2017.83
- 出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
- 摘要：Hardness and Approximation of High-Dimensional Search Problems.
- 关键词：Hardness; high-dimensional search
