Five Cells and Tilepaint are NP-Complete.
Chuzo IwamotoTatsuya IdePublished in: IEICE Trans. Inf. Syst. (2022)
Keyphrases
- np complete
- randomly generated
- np hard
- computational complexity
- constraint satisfaction problems
- pspace complete
- conjunctive queries
- satisfiability problem
- np complete problems
- phase transition
- data complexity
- sat problem
- polynomial time complexity
- polynomially solvable
- cellular automaton
- bounded treewidth
- visual cortex
- manufacturing cell
- living cells
- microscopy images
- medical images
- databases
- quantitative analysis
- lower bound
- search space