Logspace and Logtime Leaf Languages

Information and Computation

Volumn 129, Issue 1, 1996, Pages 21-33

  Jenner, Birgit ^a   McKenzie, Pierre ^b   Thérien, Denis ^c  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (50)

1. Alvarez, C. and Jenner, B. (1993), A very hard log-space counting class, Theoret. Comput. Sci. 107, 3-30.
2. Angluin, D. (1980), On counting problems and the polynomial-time hierarchy, Theoret. Comput. Sci. 12, 161-173.
3. 1 formulae on finite structures, Ann. Pure Appl. Logic 24, 1-48.
4. Baker, T., Gill, J., and Solovay, R. (1975), Relativizations of the P = ?NP question, SIAM J. Comput. 4, 431-442.
5. Baker, T., and Selman, A. (1979), A second step toward the polynomial hierarchy, Theoret. Comput. Sci. 8, 177-187.
6. 1, J. Comput. System Sci. 38, 150-164.
7. 1, J. Comput. System Sci. 41, 274-306.
8. Barrington, D. M., Straubing, H., and Thérien, D. (1990), Non-uniform automata over groups, Inform. and Comput. 89, 109-132.
9. 1, J. Assoc. Comput. Mach. 35, 941-952.
10. Beaudry, M., McKenzie, P., Péladeau, P., and Thérien, D. (1993), Finite monoids: From word to circuit evaluation, To appear in SIAM J. Comput. Preliminary version appeared as Circuits with monoidal gates in Proc. of the 10th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 665, pp. 555-565, Springer- Verlag, Berlin/New York.
11. Beaudry, M., McKenzie, P., Péladeau, P., and Thérien, D. (1993), Finite monoids: From word to circuit evaluation, To appear in SIAM J. Comput. Preliminary version appeared as Circuits with monoidal gates in Proc. of the 10th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 665, pp. 555-565, Springer-Verlag, Berlin/New York.
12. Bédard, F., Lemieux, F. and McKenzie, P. (1993), Extensions to Barrington's M-program model, Theoret. Comput. Sci. A 107, 1, 31-61.
13. Beigel, R. and Gill, J. (1992), Counting classes: Thresholds, parity, mods, and fewness, Theoret. Comput. Sci. 103 (1992), 3-24.
14. Borchert, B. (1994), On the acceptance power of regular languages, in "Proc. of the 11 th Symp. on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 775, pp. 533-541.
15. Borchert, B., and Lozano, A. (1995), "Succinct circuit representation and leaf languages are basically the same concept," Technical Report Nr. 17, Mathematisches Institut, Universität Heidelberg, July 1995.
16. Borodin, A., Fisher, M. J., Kirkpatrick, D. G., Lynch, N. A., and Tompa, M. (1981), A time-space tradeoff for sorting on non-oblivious machines, J. Comput. System Sci. 22 (1981), 351-364.
17. Bovet, D., Crescenzi, P., and Silvestri, R. (1991), Complexity classes and sparse oracles, in "Proc. of the 6th IEEE Structure in Complexity Theory Conference, 1991," pp. 102-108.
18. Bovet, D., Crescenzi, P., and Silvestri, R. (1992), A uniform approach to define complexity classes, Theoret. Comput. Sci. 104, 263-283.
19. Buntrock, G., Damm, C., Hertrampf, U. and Meinel, C. (1992), Structure and importance of Logspace-MOD-classes, Math. System Theory 25, 223-237.
20. Buss, S. R. (1987), The Boolean formula value problem is in ALOGTIME, in "Proc. of the 19th ACM Symp. on the Theory of Computing, 1987," pp. 123-131.
21. Buss, S. R., Cook, S., Gupta, A., and Ramachandran, V. (1992), An optimal parallel algorithm for formula evaluation, SIAM J. Comput. 21, 4, 755-780.
22. Cai, L., and Chen, J. (1995), On input read-modes of alternating Turing machines, Theoret. Comput. Sci. 148, 33-55.
23. Cai, L., Chen, J., and Håstad, J. (1996), Circuit bottom fan-in and computational power, in SIAM J. Comput., to appear.
24. 1 computation, in "11th Proc. Computational Complexity Conf.," IEEE, (1996), 12-21.
25. Chandra, A., Kozen, D., and Stockmeyer, L. (1981). Alternation, J. Assoc. Comput. Mach. 28 (1981), 114-133.
26. Cohen, R., and Brzozowski, J. (1971), Dot-depth of star-free events, J. Comput. System Sci. 5, 1-16.
27. Cook, S. A. (1985), A taxonomy of problems with fast parallel solutions, Inform. and Comput. 64 (1985), 2-22.
28. Furst, M. L, Saxe, J. B., and Sipser, M. (1984), Parity, circuits, and the polynomial-time hierarchy, Math. Systems Theory 17 (1984), 13-27.
29. Håstad, J. (1986), Almost optimal lower bounds for small-depth circuits, in "Proc. 18th ACM STOC, 1986," pp. 6-20.
30. Hertrampf, U. (1994), Complexity classes with finite acceptance types, "Proc. of the 11 th Symp. on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 775, pp. 543-553, Springer-Verlag, Berlin/New York.
31. Hertrampf, U., Lautemann, C., Schwentick, T., Vollmer, H., and Wagner, K. (1993), On the power of polynomial time bit-reductions, in "Proceedings of the 8th IEEE Structure in Complexity Theory Conference, 1993," pp. 200-207.
32. Hertrampf, U., Vollmer, H., and Wagner, K. (1996), On balanced vs. unbalanced computation trees, Math. Systems Theory 29 (1996), 411-421.
33. Immerman, N. (1988), Nondeterministic space is closed under complementation, SIAM J. Comput. 17, 5, 935-938.
34. Lupanov, O. (1961), Implementing the algebra of logic functions in terms of constant-depth formulas in the basis +, *, -, Dokl. Akad. Nauk SSSR 136, 5; English translation in Sov. Phys. Dokl. 6.
35. Lupanov, O. (1961), Implementing the algebra of logic functions in terms of constant-depth formulas in the basis +, *, -, Dokl. Akad. Nauk SSSR 136, 5; English translation in Sov. Phys. Dokl. 6.
36. 1: The automatatheoretic viewpoint, Comput. Complexity 1 (1991), 330-359.
37. Muscholl, A. (1992), "Characterizations of LOG, LOGDCFL and NP Based on Groupoid Programs," Extended abstract, Institut für Informatik, Universität Stuttgart.
38. Papadimitriou, C., and Zachos, S. (1983), Two remarks on the power of counting, in "Proc. 6th GI Conf. on Theoretical Computer Science," Lecture Notes in Computer Science, Vol. 145, pp. 269-276, Springer-Verlag, Berlin/New York.
39. Ruzzo, W. (1981), On uniform circuit complexity, J. Comput. System Sci. 22, 365-383.
40. Ruzzo, W., Simon, J., and Tompa, M. (1984), Space-bounded hierarchies and probabilistic computations, J. Comput. System Sci. 28, 216-230.
41. Savitch, W. J. (1970), Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci. 4, 177-192.
42. Stockmeyer, L. (1977), The polynomial-time hierarchy, Theoret. Comput. Sci. 3, 1-22.
43. Sudborough, I. H. (1978), On the tape complexity of deterministic context-free languages, J. Assoc. Comput. Mach. 25, 405-414.
44. Szelepcsényi, R. (1988), The method of forced enumeration for nondeterministic automata, Acta Informat. 26, 279-284.
45. Torán, J. (1988), "Structural Properties of the Counting Hierarchies," Ph.D. Thesis, Tech. Rep. LSI-88-2, Universitat Polytècnica de Catalunya.
46. Valiant, L. G. (1979), The complexity of computing the permanent, Theoret. Comput. Sci. 8, 189-201.
47. Veith, H. (1996), Succinct representation, leaf languages, in "11th Proc. Computational Complexity Conf.," IEEE, (1996), 118-126.
48. Vershchagin, N. K. (1994) Relativizable and nonrelativizable theorems in the polynomial theory of algorithms, Russ. Acad. Sci. Izv. Math. 42, 261-298.
49. Yao, A. (1985), Separating the polynomial-time hierarchy by oracles, in "Proc. 26th IEEE FOCS," pp. 1-10.
50. Yao, A. (1990). On ACC and threshold circuits, in "Proc. of the 31st IEEE Symp. on the Foundations of Computer Science," pp. 619-627.