The following pages link to How easy is local search? (Q1109573):
Displaying 25 items.
- The NP Search Problems of Frege and Extended Frege Proofs (Q5278209) (← links)
- TFNP: An Update (Q5283350) (← links)
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems (Q5283361) (← links)
- Sublinear-Time Algorithms for Tournament Graphs (Q5323094) (← links)
- COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE (Q5408357) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- Fully Polynomial-Time Approximation Schemes for Fair Rent Division (Q5868945) (← links)
- On the Complexity of Equilibrium Computation in First-Price Auctions (Q5885597) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
- PPAD-complete approximate pure Nash equilibria in Lipschitz games (Q6069844) (← links)
- On parallel versus sequential approximation (Q6102318) (← links)
- The price of anarchy in series-parallel network congestion games (Q6120906) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)
- Approximation algorithms on \(k\)-correlation clustering (Q6151012) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q6162056) (← links)
- Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy (Q6164505) (← links)
- Further collapses in \(\mathsf{TFNP}\) (Q6543098) (← links)
- The frontier of intractability for EFX with two agents (Q6546301) (← links)
- Parallel heuristic search -- introductions and a new approach (Q6560213) (← links)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- The parameterized complexity of welfare guarantees in Schelling segregation (Q6614026) (← links)
- Note on constrained long choice with multiple beginning elements (Q6661767) (← links)
