The following pages link to Unique end of potential line (Q2194856):
Displaying 17 items.
- The complexity of the parity argument with potential (Q2037189) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets (Q2154096) (← links)
- Outermost ground termination (Q2851054) (← links)
- (Q4989405) (← links)
- (Q5088968) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- (Q5881546) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
- Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets (Q6165551) (← links)
- Further collapses in \(\mathsf{TFNP}\) (Q6543098) (← links)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)
- The crossing Tverberg theorem (Q6624180) (← links)
- Note on constrained long choice with multiple beginning elements (Q6661767) (← links)
