Publisher
Springer International Publishing
Reference5 articles.
1. Ben-Amram, A.M., Jones, N.D.: Computational complexity via programming languages: constant factors do matter. Acta Inform. 37, 83–120 (2000)
2. Cook, S.A.: An overview of computational complexity. Commun. ACM 26(6), 400–408 (1983)
3. Cook, S.A., Reckhow, R.A.: Time-bounded random access machines. J. Comput. Syst. Sci. 7, 354–375 (1973)
4. Dahl, C., Hesselund, M.: Determining the constant coefficients in a time hierarchy. Student report 94-2-2, DIKU (University of Copenhagen) (1994)
5. Jones, N.D.: Computability and Complexity: From a Programming Perspective. MIT Press, Cambridge (1997) (Also available online at
http://www.diku.dk/neil/Comp2book.html
)