Computational complexity via programming languages: Constant factors do matter

Acta Informatica

Volumn 37, Issue 2, 2000, Pages 83-120

  Ben Amram, Amir M ^a   Jones, Neil D ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034594504     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360000038     Document Type: Article

References (39)

1. 1. Angluin D., Valiant L.: Fast probabilistic algorithms for hamiltonian circuits and matchings. J. Comput. Syst. Sci. 18, 155-193 (1979)
2. 2. Balcázar J.L., Díaz J., Gabarró J.: Structural Complexity I, second edition. Berlin: Springer 1995
3. 3. Ben-Amram A.M.: On the power of random access machines. PhD thesis, Tel-Aviv University 1995
4. 4. Ben-Amram A.M.: What is a "pointer machine"? SIGACT News 26:2, 88-95 (1995) See also http://www.diku.dk/research-groups/topps/bibliography/1998.html#D-351
5. 5. Ben-Amram A.M., Galil Z.: On pointers versus adresses. J. ACM 39:3, 617-649 (1992)
6. 6. Ben-Amram A.M., Jones N.D.: A precise version of a time hierarchy theorem. Fundamenta Informaticae 38, 1-15 (1999)
7. 7. Ben-Amram A.M., Petersen H.: Cons-free programs with tree input. Proceedings of ICALP 1998, Lect. Notes Comput. Sci. 1443, Berlin Heidelberg New York: Springer 1998
8. 8. Blum M.: A Machine-Independent Theory of the Complexity of Recursive Functions. J. ACM 14:2, 322-336 (1967)
9. 9. Cook S.A.: Linear time simulation of deterministic two-way pushdown automata. Proceedings of IFIP Congress 1971, 75-80. Amsterdam: North-Holland 1972
10. 10. Cook S.A., Reckhow R.A.: Time bounded random access machines. J. Comput. Sys. Sci. 7:4, 354-375 (1973)
11. 11. Fürer M.: The tight deterministic time hierarchy. In Proc. of the 14th Annual ACM Symp. on Theory of Computing, pp 8-16, San Francisco, CA, 1982
12. 12. Grandjean E.: Linear time algorithms and NP-complete problems. SIAM J. Comput. 23:3, 573-597 (1994)
13. 13. Gurevich Y.: Kolmogorov machines and related issues, the column on Logic in Computer Science. Bull. EATCS 35, 71-82 (1988)
14. 14. Gurevich Y., Shelah S.: Nearly linear time. Logic at Botik, Lect. Notes Comput. Sci. 363, Berlin Heidelberg New York: Springer 1989
15. 15. Hartmanis J.: Computational Complexity of Random Access Stored Program Machines. Math. Syst. Theory 5:3, 232-245 (1971)
16. 16. Hopcroft J.E., Ullman J.D.: Introduction to automata theory, languages, and computation. New York: Addison-Wesley 1979
17. 17. Jones N.D.: A note on linear time simulation of deterministic two-way pushdown automata. Inf. Process. Lett. 6:4, 110-112 (1977)
18. 18. Jones N.D.: Constant time factors do matter, Proc. 25th Annual ACM Symp. on Theory of Computing, pp 602-611 (1993)
19. 19. Jones N.D.: Computability and Complexity. Cambridge, Mass.: MIT Press 1997
20. 20. Jones N.D.: LOGSPACE and PTIME characterized by programming languages. Theor. Comput. Sci. 228, 151-174 (1999)
21. 21. Kleene S.C.: Introduction to Metamathematics. Amsterdam: North-Holland 1952
22. 22. Knuth D.: The Art of Computer Programming, vol 1: Fundamental algorithhms. New York: Addison-Wesley 1968, 1973, 1997
23. 23. Levin L.A.: Universal sequential search problems (in Russian). Probl. Peredachi Inf. IX, 115-116 (1972), English translation in Plenum Press Russian translations (1973)
24. 24. Luginbuhl D.R., Loui M.C.: Hierarchies and space measures for pointer machines. Information and Control 104:2, 253-270 (1993)
25. 25. Pippenger N.: Pure versus Impure Lisp. ACM Trans. Program. Lang. Syst. (TOPLAS) 19:2, 223-238 (1997)
26. 26. Regan K.W.: Machind models and linear time complexity, Complexity Theory Column 2 (L. A. Hemaspaandra, ed.), SIGACT News 24:3, 5-15 (1993)
27. 27. Regan K.W.: Linear Speed-Up, Information Vicinity, and Finite-State Machines. In: B. Pehrson, I. Simon (Eds.): Technology and Foundations - Information Processing '94, Vol. 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 1994, pp 609-614, Amsterdam: North-Holland 1994
28. 28. Rogers H.: Theory of Recursive Functions and Effective Computability. New York: McGraw-Hill 1967
29. 29. Rose E.: Linear time hierarchies for a functional language machine model. In: Programming Languages and Systems - ESOP '96 (H. R. Nielson, ed.), 311-325, Lect. Notes Comput. Sci. 1058, Berlin Heidelberg New York: Springer 1996
30. 30. Schnorr C.P.: Optimal algorithms for self-reducible problems. Proceedings of the 3rd ICALP, pp 322-337 (1976)
31. 31. Schnorr C.P.: Satisfiability is Quasilinear Complete in NQL. J. ACM 25:1, 136-145 (1978)
32. 32. Schönhage A.: Storage modification machines. SIAM J. Comput. 9, 492-508 (1980)
33. 33. Seiferas J.I.: Machine-independent complexity theory. Handbook of Theoretical Computer Science, Vol. A, pp 165-186, J. van Leeuwen (ed.), Amsterdam: Elsevier 1990
34. 34. Seiferas J.I., Fischer M.J., Meyer A.R.: Separating nondeterministic time complexity classes. J. ACM 25, 146-167 (1978)
35. 35. Sudborough H., Zalcberg Z.: On families of languages defined by time-bounded random access machines. SIAM J. Comput. 5, 217-230 (1976)
36. 36. van Emde Boas P.: Space measures for storage modification machines. Inf. Process. Lett. 30, 103-110 (1989)
37. 37. van Emde Boas P.: Machine models and simulations. Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen (ed.), Amsterdam: Elsevier 1990
38. 38. Voda P.J.: Subrecursion as a basis for a feasible programming language. In: Proc. of the 8th workshop on computer science logic (CSL 94), Lect. Notes Comput. Sci. 933, Berlin Heidelberg New York: Springer 1995
39. 39. Žák S.: A Turing machine time hierarchy (note), Theor. Comput. Sci. 26, 327-333 (1983)