Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages

Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages Theodore P. Baker Juris Hartmanis 392-396 conf/focs/FOCS20 1979 FOCS db/conf/focs/focs79.html#BakerH79 https://doi.org/10.1109/SFCS.1979.41 https://doi.ieeecomputersociety.org/10.1109/SFCS.1979.41