Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard.
Alexander PerekrestenkoPublished in: LATA (2008)
Keyphrases
- np hard
- special case
- scheduling problem
- optimal solution
- natural language
- branch and bound algorithm
- approximation algorithms
- computational complexity
- grammatical inference
- np hardness
- np complete
- linear programming
- worst case
- visual languages
- closely related
- remains np hard
- greedy heuristic
- lower bound
- integer programming
- tree grammars
- mildly context sensitive
- minimum cost
- knapsack problem
- set cover
- multiresolution
- decision problems
- approximation ratio
- computationally hard
- image encryption
- phrase structure
- constraint satisfaction problems
- digital images
- parse selection
- neural network