Q5091211 (Q5091211): Difference between revisions

@@ Property / cites work @@
+Minimization algorithms and random walk on the d-cube
+Normal rank
@@ Property / cites work @@
+A note on two fixed point problems
@@ Property / cites work: A note on two fixed point problems / rank @@
+Normal rank
@@ Property / cites work @@
+On algorithms for discrete and approximate brouwer fixed points
+Normal rank
@@ Property / cites work @@
+Matching algorithmic bounds for finding a Brouwer fixed point
+Normal rank
@@ Property / cites work @@
+On the complexity of 2D discrete fixed point problem
+Normal rank
@@ Property / cites work @@
+Settling the complexity of computing two-player Nash equilibria
+Normal rank
@@ Property / cites work @@
+The complexity of stochastic games
@@ Property / cites work: The complexity of stochastic games / rank @@
+Normal rank
@@ Property / cites work @@
+The Linear Complementarity Problem
@@ Property / cites work: The Linear Complementarity Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Computing a Nash Equilibrium
@@ Property / cites work: The Complexity of Computing a Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365081
@@ Property / cites work: Q5365081 / rank @@
+Normal rank
@@ Property / cites work @@
+A converse to Banach's fixed point theorem and its CLS-completeness
+Normal rank
@@ Property / cites work @@
+Discrete Fixed Points: Models, Complexities, and Applications
+Normal rank
@@ Property / cites work @@
+ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP
@@ Property / cites work: ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Nash Equilibria and Other Fixed Points
+Normal rank
@@ Property / cites work @@
+The complexity of pure Nash equilibria
@@ Property / cites work: The complexity of pure Nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+Unique end of potential line
@@ Property / cites work: Unique end of potential line / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of All-switches Strategy Improvement
+Normal rank
@@ Property / cites work @@
+Q5365038
@@ Property / cites work: Q5365038 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Stable Outcomes in Hedonic Games
@@ Property / cites work: Computing Stable Outcomes in Hedonic Games / rank @@
+Normal rank
@@ Property / cites work @@
+Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
+Normal rank
@@ Property / cites work @@
+The Random‐Facet simplex algorithm on combinatorial cubes
+Normal rank
@@ Property / cites work @@
+ARRIVAL: Next Stop in CLS
@@ Property / cites work: ARRIVAL: Next Stop in CLS / rank @@
+Normal rank
@@ Property / cites work @@
+Linear programming and unique sink orientations
@@ Property / cites work: Linear programming and unique sink orientations / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Recognizing Unique Sink Orientations
+Normal rank
@@ Property / cites work @@
+The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for Random-Edge and Random-Jump on abstract cubes
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for finding Brouwer fixed points
+Normal rank
@@ Property / cites work @@
+Completely unimodal numberings of a simple polytope
+Normal rank
@@ Property / cites work @@
+Approximating fixed points of weakly contracting mappings
+Normal rank
@@ Property / cites work @@
+Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
+Normal rank
@@ Property / cites work @@
+Integer factoring and modular square roots
@@ Property / cites work: Integer factoring and modular square roots / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+THREE PUZZLES ON MATHEMATICS, COMPUTATION, AND GAMES
+Normal rank
@@ Property / cites work @@
+A unified approach to interior point algorithms for linear complementarity problems: A summary
+Normal rank
@@ Property / cites work @@
+An interior point potential reduction algorithm for the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+Bimatrix Equilibrium Points and Mathematical Programming
+Normal rank
@@ Property / cites work @@
+Random edge can be exponential on abstract cubes
@@ Property / cites work: Random edge can be exponential on abstract cubes / rank @@
+Normal rank
@@ Property / cites work @@
+On total functions, existence theorems and computational complexity
+Normal rank
@@ Property / cites work @@
+Constant rank bimatrix games are PPAD-hard
@@ Property / cites work: Constant rank bimatrix games are PPAD-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Computational complexity of complementary pivot methods
+Normal rank
@@ Property / cites work @@
+Q3967358
@@ Property / cites work: Q3967358 / rank @@
+Normal rank