Author:
Allender Eric,Balaji Nikhil,Datta Samir
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Agrawal, M., Allender, E., Datta, S.: On TC0, AC0, and Arithmetic circuits. Journal of Computer and System Sciences 60(2), 395–421 (2000)
2. Allender, E., Schnorr, H.: The complexity of the BitSLP problem (2005) (unpublished manuscript)
3. Allender, E., Bürgisser, P., Kjeldgaard-Pedersen, J., Miltersen, P.B.: On the complexity of numerical analysis. SIAM J. Comput. 38(5), 1987–2006 (2009)
4. Beame, P.W., Cook, S.A., Hoover, H.J.: Log depth circuits for division and related problems. SIAM Journal on Computing 15, 994–1003 (1986)
5. Chiu, A., Davida, G.I., Litow, B.: Division in logspace-uniform NC1. Informatique Théorique et Applications 35(3), 259–275 (2001)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献