Keyphrases
- np complete
- constraint satisfaction problems
- randomly generated
- computational complexity
- np hard
- pspace complete
- satisfiability problem
- line drawings
- polynomially solvable
- conjunctive queries
- polynomial time complexity
- np complete problems
- information retrieval
- description logics
- normal form
- sat problem
- bounded treewidth
- d objects
- objective function
- learning algorithm