Author:
Allender Eric,Arvind V.,Wang Fengming
Publisher
Springer Berlin Heidelberg
Reference47 articles.
1. Agrawal, M., Allender, E., Datta, S.: On TC $^{\mbox{0}}$ , AC $^{\mbox{0}}$ , and arithmetic circuits. Journal of Computer and System Sciences 60(2), 395–421 (2000)
2. Allender, E., Arvind, V., Wang, F.: Uniform derandomization from pathetic lower bounds. Technical Report TR10-069, Electronic Colloquium on Computational Complexity, ECCC (2010)
3. Allender, E., Hellerstein, L., McCabe, P., Pitassi, T., Saks, M.E.: Minimizing disjunctive normal form formulas and AC $^{\mbox{0}}$ circuits given a truth table. SIAM Journal on Computing 38(1), 63–84 (2008)
4. Allender, E., Koucký, M.: Amplifying lower bounds by means of self-reducibility. Journal of the ACM (to appear);
5. A preliminary version appeared in Proc. IEEE Conference on Computational Complexity (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献