System BV is NP-complete.
Ozan KahramanogullariPublished in: Electron. Notes Theor. Comput. Sci. (2006)
Keyphrases
- np complete
- np hard
- randomly generated
- polynomial time complexity
- computational complexity
- constraint satisfaction problems
- conjunctive queries
- satisfiability problem
- bounded treewidth
- pspace complete
- data complexity
- phase transition
- np complete problems
- polynomially solvable
- conp complete
- databases
- bayesian networks
- database systems
- decision making
- artificial intelligence