Uriel Feige, Joe Kilian. Impossibility results for recycling random bits in two-prover proof systems. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 457-468, ACM, 1995. [doi]
@inproceedings{FeigeK95,
title = {Impossibility results for recycling random bits in two-prover proof systems},
author = {Uriel Feige and Joe Kilian},
year = {1995},
doi = {10.1145/225058.225183},
url = {http://doi.acm.org/10.1145/225058.225183},
researchr = {https://researchr.org/publication/FeigeK95},
cites = {0},
citedby = {0},
pages = {457-468},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA},
publisher = {ACM},
}