Author:
Bhatnagar Nayantara,Gopalan Parikshit,Lipton Richard J.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference20 articles.
1. Representing Boolean functions as polynomials modulo composite numbers;Barrington;Comput. Complexity,1994
2. R. Beigel, The polynomial method in circuit complexity, Structures in Complexity Theory: Eighth Annual Conference, 1993, pp. 82–95.
3. R. Beigel, Personal communication, 2003.
4. A. Chandra, M. Furst, R.J. Lipton, Multi-party protocols, Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 94–99.
5. A generalization of an irreducibility theorem of I. Schur;Filaseta;Acta Arith.,1991
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献