Storage Requirements for Deterministic Polynomial Time Recognizable Languages

Stephen A. Cook, Ravi Sethi. Storage Requirements for Deterministic Polynomial Time Recognizable Languages. J. Comput. Syst. Sci., 13(1):25-37, 1976.

Authors

Stephen A. Cook

This author has not been identified. Look up 'Stephen A. Cook' in Google

Ravi Sethi

This author has not been identified. Look up 'Ravi Sethi' in Google