Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete.

Chuzo Iwamoto Tatsuya Ide

Published in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2022)

Keyphrases

np complete
np hard
constraint satisfaction problems
satisfiability problem
randomly generated
computational complexity
polynomially solvable
pspace complete
conjunctive queries
polynomial time complexity
np complete problems
data complexity
sat problem
databases
data model
optimal solution
artificial intelligence