Author:
Tesson Pascal,Thérien Denis
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proc. 27th IEEE FOCS, pages 337–347, 1986.
2. D. A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci., 38(1):150–164, Feb. 1989.
3. D. A. M. Barrington and D. Thérien. Finite monoids and the fine structure of NC1. Journal of the ACM, 35(4):941–952, Oct. 1988.
4. C. Damm,, M. K. C. Meinel, and S. Waack. On relations between counting communication complexity classes. To appear in Journal of Computer and Systems Sciences. Currently available e.g. from http://www.num.math.uni-goettingen.de/damm/ and preliminary version in proceedings of STACS’92.
5. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献