On the complexity of intersecting finite state automata and NL versus NP

Theoretical Computer Science

Volumn 302, Issue 1-3, 2003, Pages 257-274

  Karakostas, George ^a   Lipton, Richard J ^b   Viglas, Anastasios ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b Georgia Institute of Technology   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

Complexity class separations; Finite state automata intersection; NL, NP

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PROBLEM SOLVING;

COMPLEXITY CLASS SEPARATIONS;

FINITE AUTOMATA;

EID: 0038238515     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00830-7     Document Type: Article

References (11)

1. E. Bach, Number-theoretic algorithms, in: Annual Review of Computer Science, Vol. 4, Annual Reviews, Inc., 1990, pp. 119-172.
2. R.G. Downey, M.R. Fellows, Fixed-parameter intractability (extended abstract), in: Proc. 7th Annual Structure in Complexity Theory Conf., Boston, MA, 22-25 June 1992, IEEE Computer Society Press, Silverspring, MD, pp. 36-49.
3. Downey R.G., Fellows M.R. Parameterized Complexity. 1999;Springer, Berlin.
4. U. Feige, J. Kilian, On limited versus polynomial nondeterminism, Chicago J. Theoret. Comput. Sci., March 1997.
5. Fortnow L. Diagonalization. Bull. Eur. Assoc. Theoret. Comput. Sci. 71:2000;102-112. (Columns: Computational Complexity).
6. Hopcroft J., Paul W., Valiant L. On time versus space. J. ACM. 24(2):1977;332-337.
7. Jones N.D. Space-bounded reducibility among combinatorial problems. J. Comput. System Sci. 11:1975;68-85.
8. R. Kannan, A circuit-size lower bound, in: 22nd Ann. Symp. on Foundations of Computer Science, Los Alamitos, CA, USA, IEEE Computer Society Press, Silverspring, MD, October 1981, pp. 304-309.
9. D. Kozen, Lower bounds for natural proof systems, in: 18th Ann. Symp. on Foundations of Computer Science, IEEE, London, October 1977, pp. 254-266.
10. W.J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter, On determinism versus non-determinism and related problems (preliminary version), in: 24th Ann. Symp. on Foundations of Computer Science, Tucson, Arizona, 7-9 November 1983, IEEE, London, pp. 429-438.
11. Paul W., Reischuk R. On time versus space II. J. Comput. System Sci. 22(3):1981;312-327.