Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. J. Edmonds and R. Impagliazzo, Towards time-space lower bounds on branching programs, manuscript
2. A. Chandra, M. Furst and R. Lipton, Multiparty protocols, Proceedings of 15-th ACM STOC, 1983, pp.94–99
3. J. Håstad and M. Goldmann, On the power of small depth threshold circuits, Proceedings of 31-th FOCS, 1990, pp. 610–618
4. N. Nisan, A. Wigderson, Rounds in communication complexity revisited, Proceedings of 23-th ACM STOC, 1991, pp. 419–429
5. P. Pudlak, Unexpected upper bounds on the complexity of some communication games, Proceedings of ICALP'94, Lecture Notes in Computer Science, pp.1–11.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献