On the public citation graph
On the Black-Box Complexity of Sperner’s Lemma
0 signed · 50 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.1002/mana.200310373openalex-snapshot
Mod 2 degree and a generalized No Retraction Theorem
inferredcites →https://doi.org/10.1006/jcss.1998.1575openalex-snapshot
The Relative Complexity of NP Search Problems
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.1007/s000370050008openalex-snapshot
Sperner's lemma and robust machines
inferredcites →https://doi.org/10.1016/0166-218x(89)90025-5openalex-snapshot
Local optimization on graphs
inferredcites →https://doi.org/10.1016/0166-218x(93)90004-8openalex-snapshot
Dividing and conquering the square
inferredcites →https://doi.org/10.1016/0196-6774(84)90019-1openalex-snapshot
A separator theorem for graphs of bounded genus
inferredcites →https://doi.org/10.1016/0304-3975(91)90200-lopenalex-snapshot
On total functions, existence theorems and computational complexity
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.006openalex-snapshot
Polynomial degree vs. quantum query complexity
inferredcites →https://doi.org/10.1016/s0020-0190(00)00152-6openalex-snapshot
A Sperner lemma complete for PPA
inferredcites →https://doi.org/10.1016/s0021-9800(67)80063-2openalex-snapshot
Simplicial maps from an orientable n-pseudomanifold into S with the octahedral triangulation
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.1016/s0167-5060(08)70511-9openalex-snapshot
Hamiltonian Cycles and Uniquely Edge Colourable Graphs
inferredcites →https://doi.org/10.1098/rspa.1992.0167openalex-snapshot
Rapid solution of problems by quantum computation
inferredcites →https://doi.org/10.1109/ccc.2004.1313795openalex-snapshot
Relativized NP search problems and propositional proof systems
inferredcites →https://doi.org/10.1109/ccc.2004.1313852openalex-snapshot
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
inferredcites →https://doi.org/10.1109/ccc.2004.30openalex-snapshot
Relativized NP search problems and propositional proof systems
inferredcites →https://doi.org/10.1109/fscs.1990.89602openalex-snapshot
On graph-theoretic lemmata and complexity classes
inferredcites →https://doi.org/10.1109/sfcs.2002.1181975openalex-snapshot
Quantum lower bounds for the collision and the element distinctness problems
inferredcites →https://doi.org/10.1109/sfcs.2003.1238197openalex-snapshot
Polynomial degree vs. quantum query complexity
inferredcites →https://doi.org/10.1137/s0097539704447237openalex-snapshot
Lower Bounds for Local Search by Quantum Arguments
inferredcites →https://doi.org/10.1137/s0097539796298637openalex-snapshot
On the Power of Quantum Computation
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/1007352.1007427openalex-snapshot
Quantum and classical query complexities of local search are polynomially related
inferredcites →https://doi.org/10.1145/1008731.1008735openalex-snapshot
Quantum lower bounds for the collision and the element distinctness problems
inferredcites →https://doi.org/10.1145/502090.502097openalex-snapshot
Quantum lower bounds by polynomials
inferredcites →https://doi.org/10.1145/509907.509999openalex-snapshot
Quantum lower bound for the collision problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11758471_36openalex-snapshot
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
inferred← citeshttps://doi.org/10.1007/11775096_7openalex-snapshot
Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set
inferred← citeshttps://doi.org/10.1007/11780342_12openalex-snapshot
On the Complexity of the Sperner Lemma
inferred← citeshttps://doi.org/10.1007/11786986_43openalex-snapshot
On the Complexity of 2D Discrete Fixed Point Problem
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-540-69733-6_18openalex-snapshot
Quantum Separation of Local Search and Fixed Point Computation
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-9170-6openalex-snapshot
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
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/s00453-009-9289-0openalex-snapshot
Quantum Separation of Local Search and Fixed Point Computation
inferred← citeshttps://doi.org/10.1109/focs.2006.57openalex-snapshot
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
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.1145/1007352.1007427openalex-snapshot
Quantum and classical query complexities of local search are polynomially related
inferred← citeshttps://doi.org/10.1145/1516512.1516516openalex-snapshot
Settling the complexity of computing two-player Nash equilibria
inferred← citeshttps://doi.org/10.1287/moor.1110.0511openalex-snapshot
Discrete Fixed Points: Models, Complexities, and Applications
inferred← citeshttps://doi.org/10.1287/opre.1120.1116openalex-snapshot
Algorithmic Solutions for Envy-Free Cake Cutting
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.cs/0702088openalex-snapshot
Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation
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.