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

Theodore P. Baker, Juris Hartmanis

Browse the full FOCS paper archive.