Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma. Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark. pages 33-47, IEEE Computer Society, 2003. [doi]
@inproceedings{Gutfreund03,
title = {Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games},
author = {Dan Gutfreund and Ronen Shaltiel and Amnon Ta-Shma},
year = {2003},
url = {http://csdl.computer.org/comp/proceedings/complexity/2003/1879/00/18790033abs.htm},
researchr = {https://researchr.org/publication/Gutfreund03},
cites = {0},
citedby = {0},
pages = {33-47},
booktitle = {18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark},
publisher = {IEEE Computer Society},
isbn = {0-7695-1879-6},
}