The following pages link to (Q5365081):
Displayed 30 items.
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Did the train reach its destination: the complexity of finding a witness (Q509884) (← links)
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694) (← links)
- On the complexity of finding a Caristi's fixed point (Q2032159) (← links)
- The complexity of the parity argument with potential (Q2037189) (← links)
- Computing equilibrium in network utility-sharing and discrete election games (Q2082218) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Unique end of potential line (Q2194856) (← links)
- The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
- Many-one reductions and the category of multivalued functions (Q2973252) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- ARRIVAL: Next Stop in CLS (Q5002737) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- The Hairy Ball Problem is PPAD-Complete. (Q5091222) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- (Q5092469) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- TFNP: An Update (Q5283350) (← links)
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964) (← links)
- From Minicrypt to Obfustopia via Private-Key Functional Encryption (Q5738873) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
- PPAD-complete approximate pure Nash equilibria in Lipschitz games (Q6069844) (← links)
- Improved complexity analysis of quasi-polynomial algorithms solving parity games (Q6149052) (← links)
- PPAD-complete pure approximate Nash equilibria in Lipschitz games (Q6164508) (← links)
- PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)