IP (complexity) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "IP (complexity)" in English language version.

refsWebsite

Global rank English rank

207^th place

136^th place

2^nd place

11^th place

8^th place

69^th place

59^th place

3,153^rd place

2,332^nd place

1,933^rd place

1,342^nd place

arxiv.org

Rahul Jain; Zhengfeng Ji; Sarvagya Upadhyay; John Watrous (2009). "QIP = PSPACE". arXiv:0907.4737 [quant-ph].

Lund, C.; Fortnow, L.; Karloff, H.; Nisan, N. (1990). "Algebraic methods for interactive proof systems". Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. pp. 2–10. doi:10.1109/fscs.1990.89518. ISBN 0-8186-2082-X. S2CID 32614901.
Chang Richard; et al. (1994). "The random oracle hypothesis is false". Journal of Computer and System Sciences. 49 (1): 24–39. doi:10.1016/s0022-0000(05)80084-4.
Cai JY, Threlfall RA (2004). "A note on quadratic residuosity and UP". Information Processing Letters. 92 (3): 127–131. CiteSeerX 10.1.1.409.1830. doi:10.1016/j.ipl.2004.06.015.

Furer Martin, Goldreich Oded, Mansour Yishay, Sipser Michael, Zachos Stathis (1989). "On Completeness and Soundness in Interactive Proof Systems". Advances in Computing Research: A Research Annual. 5: 429–442. CiteSeerX 10.1.1.39.9412.{{cite journal}}: CS1 maint: multiple names: authors list (link)
Cai JY, Threlfall RA (2004). "A note on quadratic residuosity and UP". Information Processing Letters. 92 (3): 127–131. CiteSeerX 10.1.1.409.1830. doi:10.1016/j.ipl.2004.06.015.

R. Chang, B. Chor, Oded Goldreich, J. Hartmanis, J. Håstad, D. Ranjan, and P. Rohatgi. The random oracle hypothesis is false. Journal of Computer and System Sciences, 49(1):24-39. 1994.
J. Watrous. PSPACE has constant-round quantum interactive proof systems. Proceedings of IEEE FOCS'99, pp. 112-119. 1999.

Lund, C.; Fortnow, L.; Karloff, H.; Nisan, N. (1990). "Algebraic methods for interactive proof systems". Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. pp. 2–10. doi:10.1109/fscs.1990.89518. ISBN 0-8186-2082-X. S2CID 32614901.

Shafi Goldwasser and Mihir Bellare. The Complexity of Decision versus Search. SIAM Journal on Computing, Volume 23, No. 1. February 1994.

A. Kitaev and J. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 608-617. 2000.