Login / Signup
Using Memoization to Achieve Polynomial Complexity of Purely Functional Executable Specifications of Non-Deterministic Top-Down Parsers.
Richard A. Frost
Published in:
ACM SIGPLAN Notices (1994)
Keyphrases
</>
formal specification
high level
vapnik chervonenkis dimension
worst case
computational complexity
computational cost
control flow
polynomial hierarchy
natural language processing
level set
decision problems
uniform distribution
dependency parsing
exponential size