Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete.
Lucas ChampollionPublished in: J. Log. Lang. Inf. (2011)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- constraint satisfaction problems
- pspace complete
- np complete problems
- polynomially solvable
- computational complexity
- phase transition
- polynomial time complexity
- link structure
- conjunctive queries
- lower bound
- link analysis
- data sets
- bounded treewidth
- social networks
- neural network