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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.