Storage Requirements for Deterministic Polynomial Time Recognizable Languages

Stephen Cook, Ravi Sethi. Storage Requirements for Deterministic Polynomial Time Recognizable Languages. In Conference Record of Sixth Annual ACM Symposium on Theory of Computing, 30 April-2 May 1974, Seattle, Washington, USA. pages 33-39, ACM, 1974.

Authors

Stephen Cook

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

Ravi Sethi

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