The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy.
Simone DantasLuérbio FariaCelina M. H. de FigueiredoRafael B. TeixeiraPublished in: Inf. Process. Lett. (2016)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- fixed parameter tractable
- constraint satisfaction problems
- pspace complete
- computational complexity
- data complexity
- low order
- conjunctive queries
- polynomially solvable
- bounded treewidth
- data sets
- polynomial time complexity
- computationally complex
- uniform distribution
- np complete problems
- relational databases
- information retrieval