On the complexity of finding a local maximum of functions on discrete planar subsets (Q1884980): Difference between revisions

@@ Property / cites work @@
+Sperner's lemma and robust machines
@@ Property / cites work: Sperner's lemma and robust machines / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential Minimax Search for a Maximum
@@ Property / cites work: Sequential Minimax Search for a Maximum / rank @@
+Normal rank
@@ Property / cites work @@
+Search Problems in the Decision Tree Model
@@ Property / cites work: Search Problems in the Decision Tree Model / rank @@
+Normal rank
@@ Property / cites work @@
+On the query complexity of finding a local maximum point.
+Normal rank
@@ Property / cites work @@
+Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
+Normal rank
@@ Property / cites work @@
+Discrete Isoperimetric Problems
@@ Property / cites work: Discrete Isoperimetric Problems / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(03)00426-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2028456923
@@ Property / OpenAlex ID: W2028456923 / rank @@
+Normal rank