NP-hard Sets and Creativeness over Constant Time Languages.
Manindra AgrawalPublished in: FSTTCS (1991)
Keyphrases
- np hard
- expressive power
- special case
- approximation algorithms
- linear programming
- np complete
- language independent
- optimal solution
- scheduling problem
- greedy heuristic
- worst case
- approximation ratio
- computational complexity
- remains np hard
- definite clause
- constraint satisfaction problems
- description languages
- grammatical inference
- integer programming
- closely related
- real time
- database systems
- databases