The Generalized Multiset Ordering is NP-Complete.
René ThiemannLukas SchmidingerPublished in: Arch. Formal Proofs (2022)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- constraint satisfaction problems
- phase transition
- polynomial time complexity
- np complete problems
- conjunctive queries
- data sets
- polynomially solvable
- constraint satisfaction
- partial order
- computational complexity
- artificial intelligence
- sat problem
- pspace complete
- bounded treewidth
- desirable properties
- neural network
- data complexity
- database