-Visibility is NP-Complete.
Chuzo IwamotoTatsuaki IbusukiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2021)
Keyphrases
- np complete
- randomly generated
- np hard
- computational complexity
- satisfiability problem
- constraint satisfaction problems
- polynomial time complexity
- pspace complete
- polynomially solvable
- conjunctive queries
- image processing
- bounded treewidth
- expressive power
- dynamic programming
- np complete problems
- data complexity
- sat problem
- computationally complex
- database