Tali Kaufman, Shachar Lovett. Worst Case to Average Case Reductions for Polynomials. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA. pages 166-175, IEEE Computer Society, 2008. [doi]
@inproceedings{KaufmanL08,
title = {Worst Case to Average Case Reductions for Polynomials},
author = {Tali Kaufman and Shachar Lovett},
year = {2008},
doi = {10.1109/FOCS.2008.17},
url = {http://dx.doi.org/10.1109/FOCS.2008.17},
researchr = {https://researchr.org/publication/KaufmanL08},
cites = {0},
citedby = {0},
pages = {166-175},
booktitle = {49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA},
publisher = {IEEE Computer Society},
}