论文信息 - An Observation on Time-Storage Trade Off - 字舞流文

An Observation on Time-Storage Trade Off

Stephen A. Cook | S. Cook

[1] Richard Edwin Stearns,et al. Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[2] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[3] Stephen A. Cook. Path systems and language recognition , 1970, STOC '70.

[4] Carl Hewitt,et al. Comparative Schematology , 1970 .

[5] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[6] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[7] H. Raymond Strong,et al. Characterizations of flowchartable recursions short version , 1972, STOC.

[8] Walter J. Savitch,et al. Maze Recognizing Automata and Nondeterministic Tape Complexity , 1973, J. Comput. Syst. Sci..