Deterministic CFL s Are Accepted Simultaneously in Polynomial Time and Log Squared Space - researchr publication bibliographies

researchr

You are not signed in
Sign in
Sign up

Stephen A. Cook. Deterministic CFL s Are Accepted Simultaneously in Polynomial Time and Log Squared Space. In Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing, 30 April-2 May, 1979, Atlanta, Georgia, USA. pages 338-345, ACM, 1979.

runs on WebDSL