On the complexity of query result diversification
From MaRDI portal
Recommendations
- Approximation algorithms for diversified search ranking
- Towards better separation between deterministic and randomized query complexity
- On the complexity of database queries
- Separation between deterministic and randomized query complexity
- Top-k diversity queries over bounded regions
- On the data complexity of consistent query answering
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Composite recommendations: from items to packages
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete
- Max-sum diversification, monotone submodular functions, and dynamic updates
- On the complexity of package recommendation problems
- Optimal aggregation algorithms for middleware.
- Polynomial Space Counting Problems
- Subtractive reductions and complete problems for counting complexity classes
- The complexity of computing the permanent
- The equitable dispersion problem
Cited in
(3)
This page was built for publication: On the complexity of query result diversification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790132)