Login / Signup
Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages
Theodore P. Baker
Juris Hartmanis
Published in:
FOCS (1979)
Keyphrases
</>
special case
expressive power
intermediate representations
computational complexity
modal logic
approximation algorithms
language independent
worst case
genetic algorithm
knowledge base
natural language
higher level
n gram
knowledge compilation
security properties
multi lingual