Storage Requirements for Deterministic Polynomial Time Recognizable Languages
暂无分享,去创建一个
[1] Leonard H. Haines,et al. Serial Compilation and the 1401 FORTRAN Compiler , 1965, IBM Syst. J..
[2] Carl Hewitt,et al. Comparative Schematology , 1970 .
[3] Stephen A. Cook,et al. An Observation on Time-Storage Trade Off , 1974, J. Comput. Syst. Sci..
[4] Daniel H. Younger,et al. Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..
[5] H. Raymond Strong,et al. Characterizations of Flowchartable Recursions , 1973, J. Comput. Syst. Sci..
[6] Ronald V. Book,et al. Comparing Complexity Classes , 1974, J. Comput. Syst. Sci..
[7] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, STOC '74.
[8] Richard Edwin Stearns,et al. Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.
[9] Ravi Sethi. Complete Register Allocation Problems , 1975, SIAM J. Comput..