Pages that link to "Item:Q839637"
From MaRDI portal
The following pages link to On the black-box complexity of Sperner's Lemma (Q839637):
Displaying 5 items.
- \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197) (← links)
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- Some results on complexity of \(\mu\)-calculus evaluation in the black-box model (Q2842242) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Logical Approaches to Computational Barriers (Q5898808) (← links)