Subject
General Computer Science,Theoretical Computer Science
Reference44 articles.
1. Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams;Ablayev,1997
2. A.V. Aho, J. Ullman, M. Yannakakis, On notions of information transfer in VLSI circuits, in: Proc. 15th STOC, 1983, pp. 133–139.
3. M. Ajtai, Determinism versus non-determinism for linear time RAMs with memory restrictions, in: Proc. 31st STOC, 1999, pp. 632–641.
4. M. Ajtai, A non-linear time lower bound for Boolean branching programs, in: Proc. 40th FOCS, 1999, pp. 60–70.
5. Non-commutative arithmetic circuits;Allender;Theoret. Comput. Sci.,1998
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献