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.
No references recorded for this publication.
No citations of this publication recorded.