Storage Requirements for Deterministic Polynomial Time Recognizable Languages
Stephen A. CookRavi SethiPublished in: STOC (1974)
Keyphrases
- storage requirements
- computational complexity
- finite automata
- grammatical inference
- significantly reduced
- expressive power
- computational cost
- language independent
- database languages
- special case
- decomposable negation normal form
- compression rate
- memory requirements
- turing machine
- high computational complexity
- worst case
- deterministic domains
- cross lingual
- target language
- multiscale
- frame rate
- approximation algorithms
- text summarization
- single image
- randomized algorithm
- databases