Table Merging by Compatible Partitions for LR Parsers is NP-complete.
Massimo AnconaAlessandro PaonePublished in: J. Inf. Process. Cybern. (1994)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- logistic regression
- constraint satisfaction problems
- database
- clustering algorithm
- pspace complete
- natural language processing
- conjunctive queries
- polynomial time complexity
- phase transition
- computational complexity
- low resolution
- data complexity
- context free grammars
- syntactic parsing
- natural language parsing
- rand index
- support vector
- special case
- high resolution
- search algorithm
- bounded treewidth
- subpixel registration