Hardness and Approximation of High-Dimensional Search Problems

Rasmus Pagh

Publikation: Konferencebidrag - EJ publiceret i proceeding eller tidsskrift › Konferenceabstrakt til konference › Forskning › peer review

Originalsprog	Engelsk
Publikationsdato	2017
DOI	https://doi.org/10.4230/LIPIcs.MFCS.2017.83
Status	Udgivet - 2017
Begivenhed	Mathematical Foundations of Computer Science - Aalborg, Danmark Varighed: 21 aug. 2017 → 25 aug. 2017 Konferencens nummer: 42 http://mfcs2017.cs.aau.dk

Konference	Mathematical Foundations of Computer Science
Nummer	42
Land/Område	Danmark
By	Aalborg
Periode	21/08/2017 → 25/08/2017
Internetadresse	http://mfcs2017.cs.aau.dk

Adgang til dokumentet

SSS: Scalable Similarity Search
Pagh, R. (PI), Christiani, T. L. (CoI), Pham, N. D. (CoI), Faithfull, A. (CoI), Silvestri, F. (CoI), Mikkelsen, J. W. (CoI), Sivertsen, J. V. T. (CoI), Aumüller, M. (CoI), Skala, M. (CoI), Ceccarello, M. (CoI), Themsen, R. (CoI), Jacob, R. (CoI), McCauley, S. (CoI) & Ahle, T. D. (CoI)
European Commission
01/05/2014 → 30/04/2019
Projekter: Projekt › Forskning

@conference{5df098d76bfe4ddfbd59b257b9109838,

title = "Hardness and Approximation of High-Dimensional Search Problems",

author = "Rasmus Pagh",

year = "2017",

doi = "10.4230/LIPIcs.MFCS.2017.83",

language = "English",

note = "Mathematical Foundations of Computer Science, MFCS ; Conference date: 21-08-2017 Through 25-08-2017",

url = "http://mfcs2017.cs.aau.dk",

}