Shellability is NP-Complete.
Xavier GoaocPavel PatákZuzana PatákováMartin TancerUli WagnerPublished in: SoCG (2018)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- polynomial time complexity
- data complexity
- pspace complete
- polynomially solvable
- data sets
- artificial intelligence
- bounded treewidth
- np complete problems
- expert systems
- dynamic programming
- database systems
- decision making
- conjunctive queries
- machine learning
- computationally complex