Monadic logical definability of nondeterministic linear time

Computational Complexity

Volumn 7, Issue 1, 1998, Pages 54-97

  Grandjean, E ^a   Olive, F ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

Computational complexity; Descriptive complexity; Finite model theory; Linear time; Monadic second order logic; Nondeterminism; NP complete problem; Random access machine; Unary functions

Indexed keywords

EID: 0032365314     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001594     Document Type: Article

References (31)

1. J.R. BÜCHI, Weak second order arithmetic and finite automata, Z. Math. Logik Grundlagen Math. 6 (1960), pp. 66-92.
2. B. COURCELLE, The expression of graph properties and graph transformations in monadic second-order logic, In G. Rozenberg, editor, Handbook of graph grammars, vol. 1: Foundations. World Scientific Publisher, 1996.
3. R. FAGIN, Generalized first-order spectra and polynomial-time recognizable sets, in Complexity of Computations, R.Karp, ed., SIAM-AMS Proc. 7, 1974, pp. 43-73.
4. E. GRANDJEAN, The spectra of first-order sentence and computational complexity, SIAM J.Comput., 13 (1984), pp. 356-373.
5. E. GRANDJEAN, Universal quantifiers and time complexity of random access machines, Math. Systems Theory, 18 (1985), pp. 171-187.
6. E. GRANDJEAN, A natural NP-complete problem with a nontrivial lower bound, SIAM J.Comput.,17 (1988), pp. 786-809.
7. E. GRANDJEAN, A nontrivial lower bound for an NP problem on automata, SIAM J. Comput., 19 (1990), pp. 438-451.
8. E. GRANDJEAN, First-order spectra with one variable, J. of Comput. and System Sci., 40 (1990), pp. 136-153.
9. E. GRANDJEAN, Invariance properties of RAMs and linear time, Computational Complexity, 4 (1994), pp. 62-106.
10. E. GRANDJEAN, Linear time algorithms and NP-complete problems, SIAM J. Comput., 23 (1994), pp. 573-597.
11. E. GRANDJEAN, Sorting, linear time and the satisfiability problem, Annals of Math. and Artificial Intelligence, 16 (1996), pp. 183-236.
12. E. GRÄDEL, On the notion of linear time computability, International J. of Foundations of Computer Science, 1 (1990), pp. 295-307.
13. E. GRANDJEAN, F. OLIVE, Monadic Logical Definability of NP-Complete Problems, CSL'94 Proc. LNCS 933 (1995), pp. 190-204.
14. Y. GUREVICH, Toward logic tailored for computational complexity, Computation and Proof Theory, (M. M. Richter et al., eds.).Springer-Verlag Lecture Notes in Math. Vol.1104, pp. 175-216, Springer-Verlag, New York/Berlin, 1984.
15. Y. GUREVICH, Logic and the challenge of computer science, Current Trends in Theorical Computer Science, (E. Boerger Ed.), pp. 1-55, Computer science, Rockville, MD, 1986.
16. Y. GUREVICH, S. SHELAH, Nearly linear time, Lect. Notes Comput.Sci. 363 (1989), Springer-Verlag, pp. 108-118.
17. N. IMMERMAN, Languages which capture complexity classes, 15th ACM Symp. on Theory of Computing, 1983, pp. 347-354; SIAM J. Comput., 16, No.4 (1987), 760-778.
18. N. IMMERMAN, Languages which capture complexity classes, 15th ACM Symp. on Theory of Computing, 1983, pp. 347-354; SIAM J. Comput., 16, No.4 (1987), 760-778.
19. N. IMMERMAN, Relational queries computable in polynomial time, 14th ACM STOC Symp., 1982, pp. 147-152. Also appeared in revised form in Information and Control, 68 (1986), pp. 86-104.
20. N. IMMERMAN, Relational queries computable in polynomial time, 14th ACM STOC Symp., 1982, pp. 147-152. Also appeared in revised form in Information and Control, 68 (1986), pp. 86-104.
21. N. IMMERMAN, Descriptive and computational complexity, in J. Hartmanis ed., Computational Complexity Theory, Proc. of AMS Symposia in Appl. Math. 38 (1989), pp. 75-91.
22. R.M. KARP, Reducibility among combinatorial problems, IBM Symp. 1972, Complexity of Computers Computations, Plenum Press, New York, 1972.
23. P.G. KOLAITIS, M.N. THAKUR, Logical definability of NP-optimization problems, Technical report UCSC-CRL-90-48, Computer and Information Sciences, University of California, Santa-Cruz, 1990.
24. J.F. LYNCH, Complexity classes and theories of finite models, Math. Systems Theory, 15 (1982), pp. 127-144.
25. J.F. LYNCH, The quantifier structure of sentences that characterize nondeterministic time complexity, in Comput. Complexity, 2 (1992), pp. 40-66.
26. F. OLIVE, Caractérisation Logique des problèmes NP : Robustesse et Normalisation, Thèse de Doctorat, 1996, Université de Caen, France.
27. C. PAPADIMITRIOU, M. YANNAKAKIS, Optimization, Approximation and Complexity, in J.Comput.System Sci., 43 (1991), pp. 425-440.
28. J.E. PIN, Logic, semigroups and automata on words, Annals of Math. and Artificial Intelligence, 16 (1996), pp. 343-384.
29. C.P. SCHNORR, Satisfiability is quasilinear complete in NQL, J. ACM, 25 (1978), pp. 136-145.
30. W. THOMAS, Classifying regular events in symbolic logic, J. Comput. System Sci. 25 (1982), pp. 360-376.
31. M. VARDI, Complexity of relational query languages, 14th ACM Symp. on Theory of Computation, 1982, pp. 137-146.