Author:
Borodin A.,Razborov A.,Smolensky R.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference31 articles.
1. K. Abrahamson, Generalized string matching.SIAM Journal on Computing 16 (1987), 1039?1051.
2. K. Abrahamson, Time-space tradeoffs for algebraic problems on general sequential machines.JCSS 43 (1991), 269?289.
3. N. Alon andW. Maass, Meanders and their applications in lower bounds arguments.JCSS 37 (1988), 118?129.
4. L. Babai, P. Hajnal, E. Szemerédi, andG. Turan, A lower bound for read-once branching programs.JCSS 35 (1987), 153?162.
5. L. Babai, N. Nisan, and M. Szegedy, Multiparty protocols and logspacehard pseudorandom sequences. InProceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, 1?11.
Cited by
100 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献