Pages that link to "Item:Q5138782"
From MaRDI portal
The following pages link to Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782):
Displaying 5 items.
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- (Q5875699) (← links)
- Further collapses in \(\mathsf{TFNP}\) (Q6543098) (← links)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)