On complexity of maximizatin of submodular functions<sup>*</sup> (Q4256098): Difference between revisions

@@ Property / cites work @@
+Complexity of Matroid Property Algorithms
@@ Property / cites work: Complexity of Matroid Property Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the worst-case complexity of some oracle algorithms
+Normal rank
@@ Property / cites work @@
+Every poset has a central element
@@ Property / cites work: Every poset has a central element / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in Trees, Series-Parallel and Interval Orders
+Normal rank
@@ Property / cites work @@
+Searching ordered structures
@@ Property / cites work: Searching ordered structures / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in 2-dimensional partial orders
@@ Property / cites work: Searching in 2-dimensional partial orders / rank @@
+Normal rank