Nonerasing, counting, and majority over the linear time hierarchy

Information and Computation

Volumn 174, Issue 2, 2002, Pages 132-142

  Durand, Arnaud ^a   More, Malika ^b  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Computational and structural complexity; Counting classes; Logic in computer science; Rudimentary relations

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; MATHEMATICAL MODELS; POLYNOMIALS; TREES (MATHEMATICS);

LINEAR TIME HIERARCHY;

HIERARCHICAL SYSTEMS;

EID: 0036590459     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3084     Document Type: Article

References (33)

1. Angluin, D. (1980), On counting problems and the polynomial-time hierarchy, Theoret. Comput. Sci. 12, 161-173.
2. Bel'tyukov, A. (1979), A computer description and a hierarchy of initial Grzegorczyk classes, J. Soviet Math. 20, 2280-2289. Translation from (1979), Zap. Nauk. Sem. Lening. Otd. Mat. Inst., VA. Steklova AN SSSR 88, 30-46.
3. Bel'tyukov, A. (1997), One-way one-dimensional cellular automata and small subrecursive classes, in "Communication JAF' 15, Mons, Belgium," pp. 21-27.
4. Bennett, J. H. (1962), "On Spectra," Doctoral Dissertation, Princeton University, Princeton, NJ.
5. Bloch, S. A., Buss, J. F., and Goldsmith, J. Sharply bounded alternation and quasilinear time, Theoret. Comput. System 31, 187-214.
6. Buss, J. F. (1998), Relativized alternation and space-bounded computation, J. Comput. System Sci. 36, 351-378.
7. Clote, P. (1997), Nondeterministic stack register machines, Theoret. Comput. Sci. A 178, 37-76.
8. Durand, A., Lautemann, C., and More, M. (1988), Counting results in weak formalisms, preprint SDAD, 98-14.
9. Esbelin, H. A., and More, M. (1998), Rudimentary relations and primitive recursion: A toolbox, Theoret. Comput. Sci. 193, 129-148.
10. Grädel, E. (1990), On the notion of linear time computability, Internat. J. Found. Comput. Sci. 1, 295-307.
11. Grandjean, E. (1994), Linear-time algorithms and NP-complete problems, SIAM J. Comput. 23, 573-597.
12. Grandjean, E. (1996), Sorting, linear-time and the satisfiability problem, Ann. Math. Artificial Intelligence 16, 183-236.
13. Grandjean, E., and Olive, F. (1988), Monadic logical definability of nondeterministic linear time, Comput. Complex. 7, 54-97.
14. Gurevich, Y., and Shelah, S. (1989), "Nearly Linear Time," Lecture Notes in Computer Science, Vol. 363, pp. 108-118, Springer-Verlag, Berlin.
15. Hájek, P., and Pudlák, P. (1993), "Metamathematics of First-Order Arithmetic," Springer-Verlag, Berlin.
16. Harrow, K. (1973), "Sub-Elementary Classes of Functions and Relations," Doctoral Dissertation, Department of Mathematics, New York University.
17. Harrow, K. (1975), Small Grzegorczyk classes and limited minimum, Z. Math. Logik Grundlagen Math. 11, 417-426.
18. Jones, N. D. (1969), Context-free languages and rudimentary attributes, Math. System Theor. 3, 102-109.
19. More, M., and Olive, F. (1997), Rudimentary languages and second-order logic, Math. Logic Quart. 43, 419-426.
20. Myhill, G. (1960), "Linear Bounded Automata," Wright Air Devel. Div., Technical Note 60-165, Wright-Patterson Air Force Base, OH.
21. Naik, A. V., Regan, K. W., and Sivakumar, D. (1995), On quasilinear-time complexity theory, in "STACS '94, Caen, 1994," Theoret. Comput. Sci. 148, 325-349.
22. Nepomnjascii, V. A. (1970), Rudimentary predicates and Turing calculations, Soviet Math. Dokl. 11, 1462-1465.
23. Paris, J. B., Handley, W. G., and Wilkie, A. J. (1987), Characterizing some low arithmetic classes, Colloq. Math. Soc. Janos Bolyai 44, 353-365.
24. Paris, J. B., and Wilkie, A. J. (1985), Counting problems in bounded arithmetics, "Methods in Mathematical Logic, Proceedings, Caracas, 1983," Lecture Notes in Mathematics, Vol. 1130, pp. 317-340, Springer-Verlag, Berlin.
25. 0 sets, Fund. Math. 127, 67-76.
26. Schnorr, C. P. (1978), Satisfiability is quasi-linear complete in NQL, J. Assoc. Comput. Mach. 25, 136-145.
27. Smullyan, R. (1961), "Theory of Formal Systems," Annals of Math. Studies, Vol. 47, Princeton Univ. Press, Princeton, NJ.
28. Stockmeyer, L. J. (1976), The polynomial time hierarchy, Theoret. Comput. Sci. 3, 1-22.
29. Toda, S. (1989), On the computational power of PP and ⊕P, in "IEEE Symposium on Foundations of Computer Science," pp. 514-519.
30. Torán, J. (1991), Complexity classes defined by counting quantifiers, J. Assoc. Comput. Mach. 38, 753-774.
31. Valiant, L. (1979), The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (3), 410-421.
32. Wagner, K. W. (1986), The complexity of combinatorial problems with succint input representation, Acta Inform. 23, 325-356.
33. Wrathall, C. (1978), Rudimentary predicates and relative computation, SIAM J. Comput. 7, 194-209.