Author:
Benedikt Michael,Lenhardt Rastislav,Worrell James
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Abe, N., Warmuth, M.K.: On the computational complexity of approximating distributions by probabilistic automata. Machine Learning 9, 205–260 (1992)
2. 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)
3. Ben-Or, M., Kozen, D., Reif, J.H.: The complexity of elementary algebra and geometry. JCSS 32(2), 251–264 (1986)
4. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer (1997)
5. Borodin, A., Cook, S.A., Pippenger, N.: Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control 58(1-3), 113–136 (1983)
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献