Publisher
Springer International Publishing
Reference27 articles.
1. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. University Press, Cambridge (2009)
2. Bertoni, A., Mauri, G., Sabadini, N.: Simulations among classes of random access machines and equivalence among numbers succinctly represented. In: Annals of Discrete Mathematics. North-Holland Mathematics Studies, vol. 109, pp. 65–89. Elsevier (1985)
3. Buss, R.: Bounded Arithmetic. Bibliopolis, Naples (1986)
4. Clote, P.: Boolean Functions and Computation Models. Springer, Heidelberg (2002)
5. Cobham, A.: The intrinsic computational difficulty of functions. In: Proceedings of the Third International Congress for Logic, Methodology and Philosophy of Science, Amsterdam, pp. 24–30. North-Holland (1965)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献