Preview
Unable to display preview. Download preview PDF.
References
L. Babai, Trading Group Theory for Randomness, Proceedings of 17th STOC, 1985, pp 421–429.
M. Ben-Or, S. Goldwasser, J. Killian and A. Wigderson, Multi-Prover Interactive Proofs: How to Remove Intractability, Proceedings of the 20th STOC, May, 1988.
B. Bollobás, Extremal Gaph Theory, Academic Press, 1978.
L. Fortnow, Complexity-Theoretic Aspects of Interactive Proof Systems, Ph. D. Thesis, Tech Report #MIT/LCS/TR-447, MIT.
L. Fortnow, J. Rompel and M. Sipser, On the Power of Multi-Prover Interactive Protocols, Proceedings of the conference on Structure in Complexity Theory, 1988, pp 156–161.
S. Goldwasser, S. Micali and C. Rackoff, The knowledge complexity of interactive protocols, Proceedings of 17th STOC, 1985, pp 291–304.
S. Goldwasser and M. Sipser, Private Coins versus Public Coins in Interactive Proof Systems, Proceedings of 18th STOC, 1986, pp 59–68.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, Jy., Condon, A., Lipton, R.J. (1990). Playing games of incomplete information. In: Choffrut, C., Lengauer, T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52282-4_32
Download citation
DOI: https://doi.org/10.1007/3-540-52282-4_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52282-9
Online ISBN: 978-3-540-46945-2
eBook Packages: Springer Book Archive