Michael Alekhnovich. More on Average Case vs Approximation Complexity. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings. pages 298-307, IEEE Computer Society, 2003. [doi]
@inproceedings{Alekhnovich03,
title = {More on Average Case vs Approximation Complexity},
author = {Michael Alekhnovich},
year = {2003},
url = {http://csdl.computer.org/comp/proceedings/focs/2003/2040/00/20400298abs.htm},
researchr = {https://researchr.org/publication/Alekhnovich03},
cites = {0},
citedby = {0},
pages = {298-307},
booktitle = {44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings},
publisher = {IEEE Computer Society},
isbn = {0-7695-2040-5},
}