Tatamibari Is NP-Complete.
Aviv AdlerJeffrey BosboomErik D. DemaineMartin L. DemaineQuanquan C. LiuJayson LynchPublished in: FUN (2021)
Keyphrases
- np complete
- np hard
- randomly generated
- computational complexity
- satisfiability problem
- pspace complete
- conjunctive queries
- data complexity
- polynomial time complexity
- constraint satisfaction problems
- bounded treewidth
- np complete problems
- phase transition
- computationally complex
- scheduling problem
- state space
- data sets
- sat problem
- cnf formula
- polynomially solvable