On the complexity of intersecting finite state automata and N L versus N P
暂无分享,去创建一个
[1] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[2] Ravi Kannan. A circuit-size lower bound , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[3] Wolfgang J. Paul,et al. On time versus space II , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[4] Uriel Feige,et al. On Limited versus Polynomial Nondeterminism , 1997, Chic. J. Theor. Comput. Sci..
[5] E. Bach. Number-Theoretic Algorithms , 1990 .
[6] 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).
[7] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.
[8] Dexter Kozen,et al. Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[9] Neil D. Jones,et al. Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..
[10] Avi Wigderson,et al. Randomness vs Time: Derandomization under a Uniform Assumption , 2001, J. Comput. Syst. Sci..
[11] Endre Szemerédi,et al. On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).