Pages that link to "Item:Q1251896"

The following pages link to Lower bounds on the worst-case complexity of some oracle algorithms (Q1251896):

Displaying 8 items.

• The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
• Local optimization on graphs (Q1122503) (← links)
• Dividing and conquering the square (Q1801677) (← links)
• Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity (Q3007613) (← links)
• Gradient methods of maximization of convex functions on discrete structures (Q3747234) (← links)
• K-greedy algorithms for independence systems (Q4173194) (← links)
• On complexity of maximizatin of submodular functions^* (Q4256098) (← links)
• More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments (Q6182675) (← links)