Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. Goldreich, O., Goldwasser, S., Linial, N.: Fault-tolerant computation in the full information model. SIAM Journ. on Computing 27(2), 506–544 (1998)
2. Sanghvi, S., Vadhan, S.: The Round Complexity of Two-Party Random Selection. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing. Baltimore, MD, USA, pp. 338–347
3. Lecture Notes in Computer Science;H. Buhrman,2007
4. Schwalbe, U., Walker, P.: Zermelo and the Early History of Game Theory. Games and Economic Behavior 34(1), 123–137 (2001)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献