Application of a Planar Separator Theorem
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Umberto Bertelè,et al. Nonserial Dynamic Programming , 1972 .
[3] Ravi Sethi. Complete Register Allocation Problems , 1975, SIAM J. Comput..
[4] Mike Paterson. Tape Bounds for Time-Bounded Turing Machines , 1972, J. Comput. Syst. Sci..
[5] Richard J. Lipton,et al. Space and Time Hierarchies for Classes of Control Structures and Data Structures , 1976, JACM.
[6] Carl Hewitt,et al. Comparative Schematology , 1970 .
[7] Dexter Kozen,et al. On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[8] L. Goldschlager. The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.
[9] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[10] Robert E. Tarjan,et al. Space bounds for a game on graphs , 1976, STOC '76.
[11] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .
[12] Stephen A. Cook,et al. An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..
[13] Richard J. Lipton,et al. Multidimensional Searching Problems , 1976, SIAM J. Comput..
[14] A. George. Nested Dissection of a Regular Finite Element Mesh , 1973 .
[15] Arnon Rosenthal. Nonserial dynamic programming is optimal , 1977, STOC '77.
[16] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.
[17] Leslie G. Valiant,et al. On non-linear lower bounds in computational complexity , 1975, STOC.
[18] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.
[19] Arnold L. Rosenberg. Managing Storage for Extendible Arrays , 1975, SIAM J. Comput..