On the public citation graph
On the Complexity of 2D Discrete Fixed Point Problem
0 signed · 93 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11537311_22openalex-snapshot
On the Black-Box Complexity of Sperner’s Lemma
inferredcites →https://doi.org/10.1007/11758471_36openalex-snapshot
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
inferredcites →https://doi.org/10.1007/11786986_43openalex-snapshot
On the Complexity of 2D Discrete Fixed Point Problem
inferredcites →https://doi.org/10.1007/bf02940617openalex-snapshot
Neuer beweis für die invarianz der dimensionszahl und des gebietes
inferredcites →https://doi.org/10.1016/0885-064x(89)90017-4openalex-snapshot
Exponential lower bounds for finding Brouwer fix points
inferredcites →https://doi.org/10.1016/s0020-0190(00)00152-6openalex-snapshot
A Sperner lemma complete for PPA
inferredcites →https://doi.org/10.1016/s0022-0000(05)80063-7openalex-snapshot
On the complexity of the parity argument and other inefficient proofs of existence
inferredcites →https://doi.org/10.1109/focs.2006.20openalex-snapshot
Computing Nash Equilibria: Approximation and Smoothed Complexity
inferredcites →https://doi.org/10.1109/fscs.1990.89602openalex-snapshot
On graph-theoretic lemmata and complexity classes
inferredcites →https://doi.org/10.1145/1060590.1060638openalex-snapshot
On algorithms for discrete and approximate brouwer fixed points
inferredcites →https://doi.org/10.1145/1132516.1132527openalex-snapshot
The complexity of computing a Nash equilibrium
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11537311_22openalex-snapshot
On the Black-Box Complexity of Sperner’s Lemma
inferred← citeshttps://doi.org/10.1007/11809678_3openalex-snapshot
A Simplicial Approach for Discrete Fixed Point Theorems
inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_11openalex-snapshot
Discrete Versions of the KKM Lemma and Their PPAD-Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_37openalex-snapshot
Direction Preserving Zero Point Computing and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_57openalex-snapshot
2D-TUCKER Is PPAD-Complete
inferred← citeshttps://doi.org/10.1007/978-3-642-16170-4_13openalex-snapshot
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium
inferred← citeshttps://doi.org/10.1007/978-981-97-7752-5_13openalex-snapshot
Computations and Complexities of Tarski’s Fixed Points and Supermodular Games
inferred← citeshttps://doi.org/10.1007/s00037-022-00233-6openalex-snapshot
The Complexity of Finding Fair Independent Sets in Cycles
inferred← citeshttps://doi.org/10.1007/s00224-008-9121-2openalex-snapshot
On the Black-Box Complexity of Sperner’s Lemma
inferred← citeshttps://doi.org/10.1007/s00453-008-9169-zopenalex-snapshot
Quantum and Classical Query Complexities of Local Search Are Polynomially Related
inferred← citeshttps://doi.org/10.1007/s00453-008-9183-1openalex-snapshot
A Simplicial Approach for Discrete Fixed Point Theorems
inferred← citeshttps://doi.org/10.1007/s11856-019-1939-6openalex-snapshot
Envy-free cake division without assuming the players prefer nonempty pieces
inferred← citeshttps://doi.org/10.1016/j.cosrev.2007.09.002openalex-snapshot
Recent development in computational complexity characterization of Nash equilibrium
inferred← citeshttps://doi.org/10.1016/j.cosrev.2009.03.004openalex-snapshot
Equilibria, fixed points, and complexity classes
inferred← citeshttps://doi.org/10.1016/j.disc.2013.04.006openalex-snapshot
PPAD -completeness of polyhedral versions of Sperner’s Lemma
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106119openalex-snapshot
On the complexity of finding a Caristi's fixed point
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.09.002openalex-snapshot
2-D Tucker is PPA complete
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.05.007openalex-snapshot
Unique end of potential line
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.07.006openalex-snapshot
Understanding PPA-completeness
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.05.004openalex-snapshot
The Hairy Ball problem is PPAD-complete
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115823openalex-snapshot
Computations and complexities of Tarski’s fixed points and supermodular games
inferred← citeshttps://doi.org/10.1109/focs.2006.20openalex-snapshot
Computing Nash Equilibria: Approximation and Smoothed Complexity
inferred← citeshttps://doi.org/10.1109/focs.2007.14openalex-snapshot
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
inferred← citeshttps://doi.org/10.1109/focs.2011.26openalex-snapshot
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
inferred← citeshttps://doi.org/10.1109/focs.2016.32openalex-snapshot
On the Communication Complexity of Approximate Fixed Points
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00022openalex-snapshot
Pure-Circuit: Strong Inapproximability for PPAD
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00087openalex-snapshot
What is in #P and what is not?
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00015openalex-snapshot
Envy-Free Cake-Cutting for Four Agents
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00085openalex-snapshot
Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
inferred← citeshttps://doi.org/10.1137/1.9781611976465.155openalex-snapshot
A Topological Characterization of Modulo- p Arguments and Implications for Necklace Splitting
inferred← citeshttps://doi.org/10.1137/17m1118014openalex-snapshot
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
inferred← citeshttps://doi.org/10.1137/20m1312678openalex-snapshot
The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
inferred← citeshttps://doi.org/10.1137/21m1430042openalex-snapshot
Settling the Complexity of Nash Equilibrium in Congestion Games
inferred← citeshttps://doi.org/10.1145/1516512.1516516openalex-snapshot
Settling the complexity of computing two-player Nash equilibria
inferred← citeshttps://doi.org/10.1145/2465769.2465774openalex-snapshot
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
inferred← citeshttps://doi.org/10.1145/2591796.2591835openalex-snapshot
Constant rank bimatrix games are PPAD-hard
inferred← citeshttps://doi.org/10.1145/3188745.3188880openalex-snapshot
Consensus halving is PPA-complete
inferred← citeshttps://doi.org/10.1145/3241304openalex-snapshot
Hardness of Approximation Between P and NP
inferred← citeshttps://doi.org/10.1145/3241304.3241306openalex-snapshot
The Frontier of Intractability
inferred← citeshttps://doi.org/10.1145/3241304.3241308openalex-snapshot
Communication complexity of approximate Nash equilibrium
inferred← citeshttps://doi.org/10.1145/3241304.3241310openalex-snapshot
PPAD-hardness of approximation
inferred← citeshttps://doi.org/10.1145/3241304.3241311openalex-snapshot
The generalized circuit problem
inferred← citeshttps://doi.org/10.1145/3241304.3241319openalex-snapshot
VC and Littlestone's dimensions
inferred← citeshttps://doi.org/10.1145/3241304.3241321openalex-snapshot
2-player approximate Nash equilibrium
inferred← citeshttps://doi.org/10.1145/3313276.3316334openalex-snapshot
The complexity of splitting necklaces and bisecting ham sandwiches
inferred← citeshttps://doi.org/10.1145/3406325.3451052openalex-snapshot
The complexity of gradient descent: CLS = PPAD ∩ PLS
inferred← citeshttps://doi.org/10.1145/3485004openalex-snapshot
On Communication Complexity of Fixed Point Computation
inferred← citeshttps://doi.org/10.1145/3490486.3538297openalex-snapshot
Improved Upper Bounds for Finding Tarski Fixed Points
inferred← citeshttps://doi.org/10.1145/3568163openalex-snapshot
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
inferred← citeshttps://doi.org/10.1145/3618260.3649623openalex-snapshot
Computing a Fixed Point of Contraction Maps in Polynomial Queries
inferred← citeshttps://doi.org/10.1145/3678166openalex-snapshot
Pure-Circuit: Tight Inapproximability for PPAD
inferred← citeshttps://doi.org/10.1145/3744738openalex-snapshot
Computing a Fixed Point of Contraction Maps in Polynomial Queries
inferred← citeshttps://doi.org/10.1145/3765615openalex-snapshot
Envy-Free Cake-Cutting for Four Agents
inferred← citeshttps://doi.org/10.1287/moor.1110.0511openalex-snapshot
Discrete Fixed Points: Models, Complexities, and Applications
inferred← citeshttps://doi.org/10.1287/moor.2022.0009openalex-snapshot
The Complexity of Pacing for Second-Price Auctions
inferred← citeshttps://doi.org/10.1287/opre.1120.1116openalex-snapshot
Algorithmic Solutions for Envy-Free Cake Cutting
inferred← citeshttps://doi.org/10.1561/0400000085openalex-snapshot
Complexity Theory, Game Theory, and Economics: The Barbados Lectures
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11439openalex-snapshot
On the Approximation of Nash Equilibria in Sparse Win-Lose Games
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.38openalex-snapshot
Path Polymatrix Games are PPAD-hard
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2024.75openalex-snapshot
Total NP Search Problems with Abundant Solutions
inferred← citeshttps://doi.org/10.48550/arxiv.0907.1334openalex-snapshot
On the Complexity of Envy-Free Cake Cutting
inferred← citeshttps://doi.org/10.48550/arxiv.1006.5352openalex-snapshot
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
inferred← citeshttps://doi.org/10.48550/arxiv.1506.04882openalex-snapshot
The Complexity of the Path-following Solutions of Two-dimensional Sperner/Brouwer Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2005.09836openalex-snapshot
Computations and Complexities of Tarski's Fixed Points and Supermodular Games
inferred← citeshttps://doi.org/10.48550/arxiv.2103.13969openalex-snapshot
The Complexity of Pacing for Second-Price Auctions
showing the first 81 of 82 · page through all 82
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.