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

Rasmus Pagh (2017)

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2017.83

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics