On the public citation graph
2-D Tucker is PPA complete
0 signed · 35 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.1006/jcss.1998.1575openalex-snapshot
The Relative Complexity of NP Search Problems
inferredcites →https://doi.org/10.1007/11786986_43openalex-snapshot
On the Complexity of 2D Discrete Fixed Point Problem
inferredcites →https://doi.org/10.1007/978-3-662-47666-6_4openalex-snapshot
Short Proofs of the Kneser-Lovász Coloring Principle
inferredcites →https://doi.org/10.1007/s002220100188openalex-snapshot
Generalized Kneser coloring theorems with combinatorial proofs
inferredcites →https://doi.org/10.1007/s00493-004-0011-1openalex-snapshot
A Combinatorial Proof of Kneser’s Conjecture*
inferredcites →https://doi.org/10.1016/0097-3165(81)90027-3openalex-snapshot
A constructive proof of Tucker's combinatorial lemma
inferredcites →https://doi.org/10.1016/j.jcss.2015.08.001openalex-snapshot
Integer factoring and modular square roots
inferredcites →https://doi.org/10.1016/j.tcs.2006.03.011openalex-snapshot
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
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.1016/s0167-5060(08)70511-9openalex-snapshot
Hamiltonian Cycles and Uniquely Edge Colourable Graphs
inferredcites →https://doi.org/10.1145/1516512.1516516openalex-snapshot
Settling the complexity of computing two-player Nash equilibria
inferredcites →https://doi.org/10.1287/moor.9.4.479openalex-snapshot
Variable Dimension Complexes Part I: Basic Theory
inferredcites →https://doi.org/10.1287/moor.9.4.498openalex-snapshot
Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.1016/j.artint.2022.103784openalex-snapshot
Two's company, three's a crowd: Consensus-halving for a constant number of agents
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.10.006openalex-snapshot
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.03.004openalex-snapshot
The complexity of the parity argument with potential
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.2018.04.021openalex-snapshot
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
inferred← citeshttps://doi.org/10.1090/bull/1653openalex-snapshot
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
inferred← citeshttps://doi.org/10.1109/focs.2018.00023openalex-snapshot
PPP-Completeness with Connections to Cryptography
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/20m1312678openalex-snapshot
The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
inferred← citeshttps://doi.org/10.1137/20m1387493openalex-snapshot
Consensus-Halving: Does It Ever Get Easier?
inferred← citeshttps://doi.org/10.1137/22m1536613openalex-snapshot
Constant Inapproximability for PPA
inferred← citeshttps://doi.org/10.1145/3313276.3316334openalex-snapshot
The complexity of splitting necklaces and bisecting ham sandwiches
inferred← citeshttps://doi.org/10.1145/3391403.3399527openalex-snapshot
Consensus-Halving: Does It Ever Get Easier?
inferred← citeshttps://doi.org/10.1145/3465456.3467625openalex-snapshot
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
inferred← citeshttps://doi.org/10.1145/3519935.3520079openalex-snapshot
Constant inapproximability for PPA
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/3744738openalex-snapshot
Computing a Fixed Point of Contraction Maps in Polynomial Queries
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.24openalex-snapshot
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2024.75openalex-snapshot
Total NP Search Problems with Abundant Solutions
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2018.24openalex-snapshot
Hardness Results for Consensus-Halving
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.