Succinctness, verifiability and determinism in representations of polynomial-time languages | IEEE Conference Publication | IEEE Xplore