Deciding Twin-Width at Most 4 Is NP-Complete.
Pierre BergéÉdouard BonnetHugues DéprésPublished in: ICALP (2022)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- pspace complete
- conjunctive queries
- polynomial time complexity
- phase transition
- data sets
- decision making
- polynomially solvable
- database
- data management
- computer vision
- branch and bound algorithm
- artificial intelligence
- databases
- making decisions
- bounded treewidth
- np complete problems