On the Complexity of Query Result Diversification (Q2790132): Difference between revisions

@@ Property / OpenAlex ID @@
+W2163508424
@@ Property / OpenAlex ID: W2163508424 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4864249
@@ Property / cites work: Q4864249 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete
+Normal rank
@@ Property / cites work @@
+Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
+Normal rank
@@ Property / cites work @@
+On the Complexity of Package Recommendation Problems
+Normal rank
@@ Property / cites work @@
+Subtractive reductions and complete problems for counting complexity classes
+Normal rank
@@ Property / cites work @@
+Optimal aggregation algorithms for middleware.
@@ Property / cites work: Optimal aggregation algorithms for middleware. / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Space Counting Problems
@@ Property / cites work: Polynomial Space Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The equitable dispersion problem
@@ Property / cites work: The equitable dispersion problem / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Composite recommendations: from items to packages
@@ Property / cites work: Composite recommendations: from items to packages / rank @@
+Normal rank