On Games of Incomplete Information
暂无分享,去创建一个
[1] L. Fortnow. Complexity-Theoretic Aspects of Interactive Proof Systems , 1989 .
[2] Richard J. Lipton,et al. On bounded round multiprover interactive proof systems , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[3] B. Bollobás,et al. Extremal Graph Theory , 2013 .
[4] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[5] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[6] Richard J. Lipton,et al. Efficient Checking of Computations , 1990, STACS.
[7] L. Fortnow,et al. On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[8] Richard J. Lipton,et al. PSPACE is provable by two provers in one round , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[9] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.
[10] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[11] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[12] Richard J. Lipton,et al. Playing Games of Incomplete Information , 1990, Symposium on Theoretical Aspects of Computer Science.
[13] Uriel Feige. On the success probability of the two provers in one-round proof systems , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[14] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.