On the complexity of intersecting finite state automata and NL versus NP-Reference-Cited by-同舟云学术

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

Published:2003-06 Issue:1-3 Volume:302 Page:257-274
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Karakostas George,Lipton Richard J.,Viglas Anastasios

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference11 articles.

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. Parameterized Complexity;Downey,1999

4. U. Feige, J. Kilian, On limited versus polynomial nondeterminism, Chicago J. Theoret. Comput. Sci., March 1997.

5. Diagonalization;Fortnow;Bull. Eur. Assoc. Theoret. Comput. Sci.,2000

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection;Developments in Language Theory;2020

2. Intersection Non-emptiness and Hardness Within Polynomial Time;Developments in Language Theory;2018

3. Problems on Finite Automata and the Exponential Time Hypothesis;Algorithms;2017-02-05

4. Intersection Automata Based Model for Android Application Collusion;2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA);2016-03

5. Generating Non-plagiaristic Markov Sequences with Max Order Sampling;Lecture Notes in Morphogenesis;2016