Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete.
Matthew P. JohnsonPublished in: ISAAC (2018)
Keyphrases
- conp complete
- np complete
- np hard
- randomly generated
- computational complexity
- conjunctive queries
- linked data
- data complexity
- satisfiability problem
- polynomial time complexity
- polynomially solvable
- phase transition
- neural network
- np complete problems
- data sets
- computationally complex
- database
- constraint satisfaction problems
- search space
- case study
- pspace complete
- databases