Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545): Difference between revisions

@@ Property / OpenAlex ID @@
+W2119461694
@@ Property / OpenAlex ID: W2119461694 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7558
@@ Property / arXiv ID: 1304.7558 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for linear degeneracy testing
@@ Property / cites work: Lower bounds for linear degeneracy testing / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Universal hashing and k-wise independent random variables via integer arithmetic without primes
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+On the complexity of fixed parameter clique and dominating set
+Normal rank
@@ Property / cites work @@
+Q4886070
@@ Property / cites work: Q4886070 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for finding and counting subgraphs
+Normal rank
@@ Property / cites work @@
+On a class of \(O(n^ 2)\) problems in computational geometry
+Normal rank
@@ Property / cites work @@
+SUM, 3XOR, triangles
@@ Property / cites work: 3SUM, 3XOR, triangles / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting small induced subgraphs efficiently
+Normal rank
@@ Property / cites work @@
+Q5365132
@@ Property / cites work: Q5365132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3688439
@@ Property / cites work: Q3688439 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards polynomial lower bounds for dynamic problems
+Normal rank
@@ Property / cites work @@
+Q5417690
@@ Property / cites work: Q5417690 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding, minimizing, and counting weighted subgraphs
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank