Algebraic and logical characterizations of deterministic linear time classes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 463-474

  Schwentick, Thomas ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; TURING MACHINES;

COMPLETE PROBLEMS; COMPUTATIONAL PROBLEM; GRANDJEAN; LINEAR TIME; LOGICAL CHARACTERIZATION; RECURSION SCHEMES; SECOND VARIATION; UNARY FUNCTIONS;

ALGEBRA;

EID: 84949672214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023481     Document Type: Conference Paper

References (20)

1. S. Bellantoni. Predicative recursion and the polytime hierarchy. In P. Clote and J.B. Remmel, editors, Feasible Mathematics II, pages 15-29. Birkhäuser, 1995.
2. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Comp. Complexity, 2:97-110, 1992.
3. S.A. Bloch, J.F. Buss, and J. Goldsmith. Sharply bounded alternation within P. Technical Report TR96-011, Electronic Colloquium on Computational Complexity, 1992. http://ftp.eccc.uni-trier.de/pub/eccc/reports/1996/TR96-011/index.html.
4. A. Cobham. The intrinsic computational complexity of functions. In Y. Bar-Hillel, editor, Proceedings of: Logic, Methodology, and the Philosophy of Science, pages 24-30. North-Holland, 1964.
5. 1. Information and Control, 87:241-263, 1990.
6. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
7. E. Grädel. On the notion of linear time computability. Int. J. Found. Comput. Sci., 1:295-307, 1990.
8. E. Grädel. The expressive power of second order horn logic. In Proc. 8th Symposium on Theoretical Aspects of Computer Science STACS 91, volume 480 of LNCS, pages 466-477. Springer-Verlag, 1991.
9. E. Grädel and Y. Gurevich. Tailoring recursion for complexity. Journal of Symbolic Logic, 60:952-969, 1995.
10. E. Grandjean. A natural NP-complete problem with a nontrivial lower bound. SIAM Journal of Computing, 17:786-809, 1988.
11. E. Grandjean. A nontrivial lower bound for an NP problem on automata. SIAM Journal of Computing, 19:438-451, 1990.
12. E. Grandjean. Invariance properties of RAMs and linear time. Computational Complexity, 4:62-106, 1994.
13. E. Grandjean. Linear time algorithms and NP-complete problems. SIAM Journal of Computing, 23:573-597, 1994.
14. E. Grandjean. Sorting, linear time and the satisfiability problem. Annals of Mathematics and Artificial Intelligence, 16:183-236, 1996.
15. E. Grandjean and F. Olive. Monadic logical definability of NP-complete problems, submitted, 1996.
16. Y. Gurevich. Algebras of feasible functions. In Proc. 24th IEEE Symp. on Foundations of Computer Science, pages 210-214, 1983.
17. Y. Gurevich and S. Shelah. Nearly linear time. In A. Meyer and M. Taitslin, editors, Logic at Botik '89, Lecture Notes in Computer Science 363, pages 108-118. Springer-Verlag, 1989.
18. D. Leivant. Ramified recurrence and computational complexity I: Word recurrence and poly-time. In P. Clote and J.B. Remmel, editors, Feasible Mathematics II, pages 320-343. Birkhäuser, 1995.
19. K. Regan. Machine models and linear time complexity. SIGACT News, 24:4, Fall 1993.
20. C. P. Schnorr. Satisfiability is quasilinear complete in NQL. Journal of the ACM, 25:136-145, 1978.