The following pages link to Yves F. Verhoeven (Q839636):
Displaying 5 items.
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem (Q2503284) (← links)
- Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes (Q3434572) (← links)
- Fundamentals of Computation Theory (Q5492932) (← links)
