On the Computational Complexity of Dominance Links in Grammatical Formalisms.
Sylvain SchmitzPublished in: ACL (2010)
Keyphrases
- computational complexity
- knowledge representation
- np complete
- special case
- high computational complexity
- np hard
- natural language
- memory requirements
- nonmonotonic reasoning
- computational cost
- bit rate
- computationally efficient
- link analysis
- low complexity
- logic programming
- storage requirements
- reasoning tasks
- worst case
- decision problems
- rate distortion
- database
- natural language processing
- objective function
- web pages
- information systems
- artificial intelligence
- real time