No label defined (Q5091211)

From MaRDI portal

Revision as of 16:40, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7561549

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561549

Statements

scholarly article

0 references

0 references

0 references

0 references

0 references

publication date

21 July 2022

0 references

zbMATH Keywords

P-matrix linear complementarity problem

0 references

unique sink orientation

0 references

contraction map

0 references

TFNP

0 references

total search problems

0 references

continuous local search

0 references

MaRDI profile type

MaRDI publication profile

0 references

Minimization algorithms and random walk on the d-cube

0 references

A note on two fixed point problems

0 references

On algorithms for discrete and approximate brouwer fixed points

0 references

Matching algorithmic bounds for finding a Brouwer fixed point

0 references

On the complexity of 2D discrete fixed point problem

0 references

Settling the complexity of computing two-player Nash equilibria

0 references

The complexity of stochastic games

0 references

The Linear Complementarity Problem

0 references

The Complexity of Computing a Nash Equilibrium

0 references

0 references

A converse to Banach's fixed point theorem and its CLS-completeness

0 references

Discrete Fixed Points: Models, Complexities, and Applications

0 references

ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP

0 references

On the Complexity of Nash Equilibria and Other Fixed Points

0 references

The complexity of pure Nash equilibria

0 references

Unique end of potential line

0 references

The Complexity of All-switches Strategy Improvement

0 references

0 references

Computing Stable Outcomes in Hedonic Games

0 references

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

0 references

The Random‐Facet simplex algorithm on combinatorial cubes

0 references

ARRIVAL: Next Stop in CLS

0 references

Linear programming and unique sink orientations

0 references

The Complexity of Recognizing Unique Sink Orientations

0 references

The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games

0 references

Improved upper bounds for Random-Edge and Random-Jump on abstract cubes

0 references

Exponential lower bounds for finding Brouwer fixed points

0 references

Completely unimodal numberings of a simple polytope

0 references

Approximating fixed points of weakly contracting mappings

0 references

Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds

0 references

Integer factoring and modular square roots

0 references

How easy is local search?

0 references

THREE PUZZLES ON MATHEMATICS, COMPUTATION, AND GAMES

0 references

A unified approach to interior point algorithms for linear complementarity problems: A summary

0 references

An interior point potential reduction algorithm for the linear complementarity problem

0 references

Bimatrix Equilibrium Points and Mathematical Programming

0 references

Random edge can be exponential on abstract cubes

0 references

On total functions, existence theorems and computational complexity

0 references

Constant rank bimatrix games are PPAD-hard

0 references

Randomized pivot algorithms for \(P\)-matrix linear complementarity problems

0 references

Computational complexity of complementary pivot methods

0 references

0 references

Identifiers

10.4230/LIPIcs.ICALP.2019.56

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091211

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5091211&oldid=36832933"