Pages that link to "Item:Q519892"

The following pages link to Fixed points, Nash equilibria, and the existential theory of the reals (Q519892):

Displaying 33 items.

• Tractability conditions for numeric CSPs (Q683751) (← links)
• The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
• Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
• Termination of polynomial loops (Q2233526) (← links)
• Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
• The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
• The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
• On the Expressive Power of Query Languages for Matrices (Q3305355) (← links)
• ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (Q3448815) (← links)
• The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
• Smoothing the Gap Between NP and ER (Q5071086) (← links)
• (Q5088970) (← links)
• (Q5089213) (← links)
• Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
• Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm (Q5219680) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
• On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375) (← links)
• Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918401) (← links)
• Approximating the existential theory of the reals (Q5918470) (← links)
• On the computational complexity of decision problems about multi-player Nash equilibria (Q5918702) (← links)
• Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918795) (← links)
• Approximating the existential theory of the reals (Q5918881) (← links)
• Arrangements of pseudocircles: on circularizability (Q5918996) (← links)
• The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)
• Optimality program in segment and string graphs (Q5920196) (← links)
• The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
• The Complexity of Angular Resolution (Q6075714) (← links)
• (Q6124760) (← links)
• The complexity of the Hausdorff distance (Q6145675) (← links)
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
• RAC-Drawability is ∃ℝ-complete and Related Results (Q6181953) (← links)
• Beyond the Existential Theory of the Reals (Q6489317) (← links)