Mikhail Alekhnovich, Sanjeev Arora, Iannis Tourlakis. Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy. Computational Complexity, 20(4):615-648, 2011. [doi]
@article{AlekhnovichAT11,
title = {Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy},
author = {Mikhail Alekhnovich and Sanjeev Arora and Iannis Tourlakis},
year = {2011},
doi = {10.1007/s00037-011-0027-z},
url = {http://dx.doi.org/10.1007/s00037-011-0027-z},
researchr = {https://researchr.org/publication/AlekhnovichAT11},
cites = {0},
citedby = {0},
journal = {Computational Complexity},
volume = {20},
number = {4},
pages = {615-648},
}