Lower bounds for sorting of sums (Q1262763): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(89)90132-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2067618361
@@ Property / OpenAlex ID: W2067618361 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bound arguments with ``inaccessible'' numbers
+Normal rank
@@ Property / cites work @@
+On the complexity of computations under varying sets of primitives
+Normal rank
@@ Property / cites work @@
+How good is the information theory bound in sorting?
+Normal rank
@@ Property / cites work @@
+Sorting X + Y
@@ Property / cites work: Sorting X + Y / rank @@
+Normal rank
@@ Property / cites work @@
+Balancing poset extensions
@@ Property / cites work: Balancing poset extensions / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Linear Search Algorithm for the             <i>n</i>             -Dimensional Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparisons between linear functions can help
@@ Property / cites work: Comparisons between linear functions can help / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model
+Normal rank