Machine-independent characterizations and complete problems for deterministic linear time

SIAM Journal on Computing

Volumn 32, Issue 1, 2003, Pages 196-230

  Grandjean, Etienne ^a   Schwentick, Thomas ^b  

^a UNIVERSITÉ DE CAEN   (France)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

Affine reductions; Completeness; Linear time; Model of computation; Random access machine; Recursion schemes

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; THEOREM PROVING;

AFFINE REDUCTIONS; COMPLETENESS; LINEAR SIMULTANEOUS RECURSION SCHEME; LINEAR TIME; MODEL OF COMPUTATION; RANDOM ACCESS MACHINE;

TURING MACHINES;

EID: 0037605739     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799360240     Document Type: Article

References (36)

1. S. Bellantoni, Predicative recursion and the polytime hierarchy, in Feasible Mathematics II, P. Clote and J. Remmel, eds., Birkhaüser Boston, Boston, 1995, pp. 15-29.
2. S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the poly-time functions, Comput. Complexity, 2 (1992), pp. 97-110.
3. S. Bloch, J. Buss, and J. Goldsmith, Sharply Bounded Alternation within P. Tech. report TR96-011, Electronic Colloquium on Computational Complexity, 1996, availble online from http://ftp.eccc.uni-trier.de/pub/eccc/reports/1996/TR96-011/index.html.
4. A. Cobham, The intrinsic computational complexity of functions, in Proceedings of Logic, Methodology, and the Philosophy of Science, Y. Bar-Hillel, ed., North-Holland, Amsterdam, 1964, pp. 24-30.
5. K J. Compton and C. W. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Annals Pure Appl. Logic, 48 (1990), pp. 1-79.
6. 1, Inform. Comput., 87 (1990), pp. 241-263.
7. W. F. Dowling and J. H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming, 1 (1984), pp. 267-284.
8. A. Durand, Linear time and the power of one first-order universal quantifier, Inform. Comput., 174 (2002), pp. 132-142.
9. H.-D. Ebbinghaus and J. Flum, Finite Model Theory, 2nd ed., Springer-Verlag, Berlin, 1995.
10. R. Fagin, Easier ways to win logical games. in Proceedings of the DIMACS Workshop on Finite Models and Descriptive Complexity, AMS, Providence, RI, 1997, pp. 1-32.
11. M. R. Garey and D. S. Johnson, Computers and Intractability-A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
12. E. Grädel, On the notion of linear time computability, Internat. J. Found. Comput. Sci., 1 (1990), pp. 295-307.
13. E. Grädel, Capturing complexity classes by fragments of second order logic, Theoret. Comput. Sci., 101 (1992), pp. 35-57.
14. E. Grädel and Y. Gurevich, Tailoring recursion for complexity, J. Symbolic Logic, 60 (1995), pp. 952-969.
15. E. Grandjean, A natural NP-complete problem with a nontrivial lower bound, SIAM J. Comput., 17 (1988), pp. 786-809.
16. E. Grandjean, A nontrivial lower bound for an NP problem on automata, SIAM J. Comput., 19 (1990), pp. 438-451.
17. E. Grandjean, Invariance properties of RAMs and linear time, Comput. Complexity, 4 (1994), pp. 62-106.
18. E. Grandjean, Linear time algorithms and NP-complete problems, SIAM J. Comput., 23 (1994), pp. 573-597.
19. E. Grandjean, Sorting, linear time and the satisfiability problem, Ann. Math. Artif. Intell., 16 (1996), pp. 183-236.
20. E. Grandjean and F. Olive, Monadic logical definability of np-complete problems, in Proceedings of the 8th Annual Conference of the EACSL (CSL 94), Kazimierz, Poland, 1994, Lecture Notes in Comput. Sci. 933, Springer-Verlag, New York, 1995, pp. 190-204.
21. E. Grandjean and F. Olive, Monadic logical definability of nondeterministic linear time, Comput. Complexity, 7 (1998), pp. 54-97.
22. Y. Gurevich, Algebras of feasible functions, in Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1983, pp. 210-214.
23. Y. Gurevich and S. Shellah, Nearly linear time, in Logic at Botik '89, Lecture Notes in Comput. Sci. 363, A. Meyer and M. Taitslin, eds., Springer-Verlag, New York, 1989, pp. 108-118.
24. N. Immerman, Relational queries computable in polynomial time, Inform. Control, 68 (1986), pp. 86-104.
25. R. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
26. C. Lautemann, N. Schweikardt, and T. Schwentick, A logical characterization of nondeterministic linear time on Turing machines, in Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1563, Springer-Verlag, New York, 1999, pp. 143-152.
27. C. Lautemann and B. Weinzinger, Monadic NLIN, or weak logical reductions to SAT, in Proceedings of the 8th Annual Conference of the EACSL (CSL 99), Madrid, Spain, Lecture Notes in Comput. Sci. 1683, Springer-Verlag, New York, 1999.
28. D. Leivant, Ramified recurrence and computational complexity I: Word recurrence and polytime, in Feasible Mathematics II, P. Clote and J. Remmel, eds., Birkhäuser Boston, Boston, 1995, pp. 320-343.
29. F. Olive, A conjunctive logical characterization of nondeterministic linear time, in Proceedings of the 11th Annual Conference of the EACSL (CSL 97), Aarhus, Denmark, 1997, Lecture Notes in Comput. Sci. 1416, Springer-Verlag, New York, pp. 360-372.
30. W. J. Paul, N. Pippenger, E. Szemerédi, and W. T. Trotter, On determinism versus non-determinism and related problems (preliminary version), in Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson, AZ, 1983, pp. 429-438.
31. K. Regan, Machine models and linear time complexity, SIGACT News, 24 (1993), pp. 5-15.
32. K. Reinhardt, Strict sequential P-completeness, in Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science, 1997, Springer-Verlag, New York, 1997, pp. 329-338.
33. C. P. Schnorr, Satisfiability is quasilinear complete in NQL, J. ACM, 25 (1978), pp. 136-145.
34. T. Schwentick, Algebraic and logical characterizations of deterministic linear time classes, in Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, New York, 1997, pp. 463-474.
35. T. schwentick, Descriptive complexity, lower bounds and linear time, in Proceedings of the 12th Annual Conference of the EACSL (CSL 98), Brno, Czech Republic, 1998, Lecture Notes in Comput. Sci. 1584, Springer-Verlag, New York, 1999, pp. 9-28.
36. M. Y. Vardi, The complexity of relational query languages, in Proceedings of the 14th ACM Symposium on Theory of Computing, ACM, New York, 1982, pp. 137-146.