On the public citation graph
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
0 signed · 69 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-319-07557-0_2openalex-snapshot
On Simplex Pivoting Rules and Complexity Theory
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/bf02592948openalex-snapshot
Some NP-complete problems in quadratic and nonlinear programming
inferredcites →https://doi.org/10.1007/s10107-019-01406-yopenalex-snapshot
Lower bounds for finding stationary points I
inferredcites →https://doi.org/10.1007/s10107-021-01714-2openalex-snapshot
On the complexity of finding a local minimizer of a quadratic function over a polytope
inferredcites →https://doi.org/10.1007/s10898-012-9920-5openalex-snapshot
Approximate KKT points and a proximity measure for termination
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0041-5553(80)90098-1openalex-snapshot
The polynomial solvability of convex quadratic programming
inferredcites →https://doi.org/10.1016/0168-9274(95)00014-lopenalex-snapshot
Polynomial interpolation schemes for internal derivative distributions on structured grids
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.aim.2021.108119openalex-snapshot
Complexity aspects of local minima and related notions
inferredcites →https://doi.org/10.1016/j.apal.2012.01.015openalex-snapshot
Propositional proofs and reductions between NP search problems
inferredcites →https://doi.org/10.1016/j.jcss.2020.05.007openalex-snapshot
Unique end of potential line
inferredcites →https://doi.org/10.1016/j.jcss.2021.03.004openalex-snapshot
The complexity of the parity argument with potential
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/s0893-6080(05)80010-3openalex-snapshot
Training a 3-node neural network is NP-complete
inferredcites →https://doi.org/10.1109/focs.2009.29openalex-snapshot
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
inferredcites →https://doi.org/10.1137/0221030openalex-snapshot
The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1137/070697926openalex-snapshot
On the Complexity of Numerical Analysis
inferredcites →https://doi.org/10.1137/070699652openalex-snapshot
The Complexity of Computing a Nash Equilibrium
inferredcites →https://doi.org/10.1137/0803004openalex-snapshot
Black-Box Complexity of Local Minimization
inferredcites →https://doi.org/10.1137/080720826openalex-snapshot
On the Complexity of Nash Equilibria and Other Fixed Points
inferredcites →https://doi.org/10.1137/1.9781611974782.87openalex-snapshot
The Rainbow at the End of the Line — A PPAD Formulation of the Colorful Carathéodory Theorem with Applications
inferredcites →https://doi.org/10.1137/120874655openalex-snapshot
Reducibility among Fractional Stability Problems
inferredcites →https://doi.org/10.1137/15m1032338openalex-snapshot
Constant Rank Two-Player Games are PPAD-hard
inferredcites →https://doi.org/10.1137/17m1118014openalex-snapshot
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
inferredcites →https://doi.org/10.1137/21m1430042openalex-snapshot
Settling the Complexity of Nash Equilibrium in Congestion Games
inferredcites →https://doi.org/10.1145/1007352.1007445openalex-snapshot
The complexity of pure Nash equilibria
inferredcites →https://doi.org/10.1145/1516512.1516516openalex-snapshot
Settling the complexity of computing two-player Nash equilibria
inferredcites →https://doi.org/10.1145/2746539.2746558openalex-snapshot
The Complexity of the Simplex Method
inferredcites →https://doi.org/10.1145/3188745.3188968openalex-snapshot
A converse to Banach's fixed point theorem and its CLS-completeness
inferredcites →https://doi.org/10.1145/3313276.3316400openalex-snapshot
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
inferredcites →https://doi.org/10.1145/3406325.3451055openalex-snapshot
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
inferredcites →https://doi.org/10.1145/3406325.3451125openalex-snapshot
The complexity of constrained min-max optimization
inferredcites →https://doi.org/10.1145/3418526openalex-snapshot
On Nonconvex Optimization for Machine Learning
inferredcites →https://doi.org/10.1145/3524044openalex-snapshot
A Faster Algorithm for Finding Tarski Fixed Points
inferredcites →https://doi.org/10.1214/aoms/1177729586openalex-snapshot
A Stochastic Approximation Method
inferredcites →https://doi.org/10.4230/lipics.itcs.2020.18openalex-snapshot
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria
inferredcites →https://doi.org/10.4230/lipics.itcs.2024.75openalex-snapshot
Total NP Search Problems with Abundant Solutions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-032-08560-3_19openalex-snapshot
The Complexity of Symmetric Bimatrix Games with Common Payoffs
inferred← citeshttps://doi.org/10.1007/s00170-024-14114-5openalex-snapshot
Global tool path planning method for smooth and length-optimal machining based on vector fields
inferred← citeshttps://doi.org/10.1007/s00454-023-00532-xopenalex-snapshot
The Crossing Tverberg Theorem
inferred← citeshttps://doi.org/10.1007/s10107-024-02139-3openalex-snapshot
The computational complexity of finding stationary points in non-convex optimization
inferred← citeshttps://doi.org/10.1007/s11227-023-05827-7openalex-snapshot
FPGA-based downhole real-time inversion of petrophysical information for NMR-LWD tools with periodic thermal management
inferred← citeshttps://doi.org/10.1007/s42154-023-00229-0openalex-snapshot
A Bayesian Approach with Prior Mixed Strategy Nash Equilibrium for Vehicle Intention Prediction
inferred← citeshttps://doi.org/10.1007/s44163-025-00617-xopenalex-snapshot
Application of optimization of teacher teaching paths in physical education based on GCN
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114698openalex-snapshot
The randomized query complexity of finding a Tarski fixed point on the Boolean hypercube
inferred← citeshttps://doi.org/10.1016/j.neunet.2025.107892openalex-snapshot
RoSwish: A novel Rotating Swish activation function with adaptive rotation around zero
inferred← citeshttps://doi.org/10.1016/j.tre.2024.103415openalex-snapshot
Efficient inventory routing for Bike-Sharing Systems: A combinatorial reinforcement learning framework
inferred← citeshttps://doi.org/10.1109/cai68641.2026.11536512openalex-snapshot
Formalisation of Security for Federated Learning with DP and Attacker Advantage in IIIf for Satellite Swarms
inferred← citeshttps://doi.org/10.1109/eiecs67708.2025.11283207openalex-snapshot
A Barzilai–Borwein Adaptive Learning Rate Enhanced Conjugate Gradient Algorithm for First-Order Takagi–Sugeno Fuzzy Neural Networks
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.00033openalex-snapshot
On Pigeonhole Principles and Ramsey in TFNP
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/3618260.3649647openalex-snapshot
The Complexity of Computing KKT Solutions of Quadratic Programs
inferred← citeshttps://doi.org/10.1145/3745017openalex-snapshot
The Complexity of Computing KKT Solutions of Quadratic Programs
inferred← citeshttps://doi.org/10.1145/3765615openalex-snapshot
Envy-Free Cake-Cutting for Four Agents
inferred← citeshttps://doi.org/10.1145/3798129.3800767openalex-snapshot
The Complexity of Min-Max Optimization with Product Constraints
inferred← citeshttps://doi.org/10.14569/ijacsa.2022.0130317openalex-snapshot
A Heuristic Feature Selection in Logistic Regression Modeling with Newton Raphson and Gradient Descent Algorithm
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2680748/v1openalex-snapshot
FPGA-Based Real-time T2 Spectrum Inversion Algorithm for LWD-NMR Logging with Periodic Thermal Management
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:10)2021openalex-snapshot
Reachability Switching Games
inferred← citeshttps://doi.org/10.24963/ijcai.2023/321openalex-snapshot
The Computational Complexity of Single-Player Imperfect-Recall Games
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2024.75openalex-snapshot
Total NP Search Problems with Abundant Solutions
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.