Satogaeri, Hebi, and Suraromu Are NP-Complete.
Shohei KanehiroYasuhiko TakenagaPublished in: ACIT-CSI (2015)
Keyphrases
- np complete
- randomly generated
- np hard
- computational complexity
- constraint satisfaction problems
- conjunctive queries
- satisfiability problem
- phase transition
- data complexity
- evolutionary algorithm
- natural language
- branch and bound algorithm
- search space
- sat problem
- pspace complete
- np complete problems
- polynomially solvable
- polynomial time complexity