Pages that link to "Item:Q2848962"

The following pages link to The Query Complexity of Finding a Hidden Permutation (Q2848962):

Displaying 9 items.

• The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
• From black-box complexity to designing new genetic algorithms (Q487994) (← links)
• The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
• The \((1+1)\) elitist black-box complexity of LeadingOnes (Q1750359) (← links)
• Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
• Reducing the arity in unbiased black-box complexity (Q2251000) (← links)
• Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (Q2870055) (← links)
• Permutation Property Testing under Different Metrics with Low Query Complexity (Q4575850) (← links)
• (Q5874464) (← links)