On the complexity of intersecting finite state automata
暂无分享,去创建一个
[1] Avi Wigderson,et al. Randomness vs. time: de-randomization under a uniform assumption , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[2] Endre Szemerédi,et al. On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[3] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.
[4] Avi Wigderson,et al. Randomness vs Time: Derandomization under a Uniform Assumption , 2001, J. Comput. Syst. Sci..
[5] E. Bach. Number-Theoretic Algorithms , 1990 .
[6] Wolfgang J. Paul,et al. On time versus space II , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[7] Ravi Kannan. A circuit-size lower bound , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).