Sorting, linear time and the satisfiability problem

Annals of Mathematics and Artificial Intelligence

Volumn 16, Issue 1, 1996, Pages 183-236

  Grandjean, Etienne ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344472069     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02127798     Document Type: Article

References (27)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, 1974).
2. A.V. Aho, J.E. Hopcroft and J.D. Ullman, Data Structures and Algorithms (Addison-Wesley, Reading, 1983).
3. D. Angluin and L. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. Syst. Sci. 18(1979)155-193.
4. B. Apsvall, Recognizing disguised NR(1) instances of the satisfiability problem, J. Algorithms 1(1980)97-103.
5. A.M. Ben-Amram and Z. Galil, On pointers versus addresses, J. ACM 39(1992)617-648.
6. C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
7. K. Berman, J. Franco and J. Schlipf, Unique satisfiability for Horn sets can be solved in nearly linear time. Technical Report CS-TR-92-5, Comput. Sci. Dept., Univ. Cincinnati, OH (1992).
8. A. Bertoni, G. Mauri and N. Sabadini, Simulations among classes of random access machines and equivalence among numbers succinctly represented, Ann. Discr. Math. 25(1985)65-90.
9. K.J. Compton and C.W. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Ann. Pure Appl. Logic 48(1990)1-79.
10. S.A. Cook, The complexity of theorem proving procedures, 3rd STOC (1971) pp. 151-158.
11. A. Cook, Short propositional formulas represent nondeterministic computations. Inf. Proc. Lett. (1987/88) 269-270.
12. S.A. Cook and R.A. Reckhow, Time-bounded random access machines, J. Comput. Syst. Sci. 7(1973)354-375.
13. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press/McGraw-Hill, 1991).
14. N. Creignou, The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness, Proc. CSL'92, Lecture Notes in Computer Science 702 (1993) pp. 115-133;
15. Theor. Comput. Sci. 145(1995)111-145.
16. N. Creignou, Exact complexity of problems of incompletely specified automata, this volume, Ann. of Math, and AI 16(1996).
17. N. Creignou, Temps linéaire et problèmes NP-complet, Thèse de doctorat, Univ. de Caen, France (1993).
18. A.K. Dewdney, Linear time transformations between combinatorial problems, Int. J. Comput. Math. 11(1982)91-110.
19. W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulas, J. Logic Progr. 3(1984)267-284.
20. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: Compl. of Comp., Proc. Symp., New York (1973), SIAM-AMS Proc. 7(1974)43-73.
21. C. Froidevaux, M.C. Gaudel and M. Soria, Types de Données et Algorithmes (McGraw-Hill).
22. [21 [ M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
23. E. Graedel, on the notion of linear time computability, Proc. 3rd Italian Conf., on Theor. Comput. Sci. (World Scientific, 1989) pp. 323-334,
24. also in Int. J. Found. Comput. Sci. 1(1990)295-307.
25. E. Grandjean, A natural NP-complete problem with a nontrivial lower bound, SIAM J. Comput. 17(1988)786-809.
26. E. Grandjean, A nontrivial lower bound for an NP problem on automata, SIAM J. Comput. 19(1990)438-451.
27. E. Grandjean, Invariance properties of RAMs and linear time, Comput. Complexity 4(1994) 62-106.