$2^{łog^{1-ε} n}$ Hardness for Closest Vector Problem with Preprocessing. Khot, S., Popat, P., & Vishnoi, N. In STOC, 2012. bibtex @inproceedings{KhotPopatVishnoi,
author = "S. Khot and P. Popat and N. Vishnoi", title = "$2^{\log^{1-\epsilon} n}$ Hardness for Closest Vector Problem with Preprocessing",
booktitle = "STOC",
year = "2012"
}
Downloads: 0
{"_id":"Hy9KRpFJQnXPkRarC","bibbaseid":"khot-popat-vishnoi-2og1nhardnessforclosestvectorproblemwithpreprocessing-2012","author_short":["Khot, S.","Popat, P.","Vishnoi, N."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["S."],"propositions":[],"lastnames":["Khot"],"suffixes":[]},{"firstnames":["P."],"propositions":[],"lastnames":["Popat"],"suffixes":[]},{"firstnames":["N."],"propositions":[],"lastnames":["Vishnoi"],"suffixes":[]}],"title":"$2^{łog^{1-ε} n}$ Hardness for Closest Vector Problem with Preprocessing","booktitle":"STOC","year":"2012","bibtex":"@inproceedings{KhotPopatVishnoi,\nauthor = \"S. Khot and P. Popat and N. Vishnoi\", title = \"$2^{\\log^{1-\\epsilon} n}$ Hardness for Closest Vector Problem with Preprocessing\",\nbooktitle = \"STOC\", \nyear = \"2012\"\n}\n\n\n","author_short":["Khot, S.","Popat, P.","Vishnoi, N."],"key":"KhotPopatVishnoi","id":"KhotPopatVishnoi","bibbaseid":"khot-popat-vishnoi-2og1nhardnessforclosestvectorproblemwithpreprocessing-2012","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"people.csail.mit.edu/andyd/CCI_refs.bib","dataSources":["6sSgqzaHAPRWvSxTP"],"keywords":[],"search_terms":["hardness","closest","vector","problem","preprocessing","khot","popat","vishnoi"],"title":"$2^{łog^{1-ε} n}$ Hardness for Closest Vector Problem with Preprocessing","year":2012}