ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1812.08480
  4. Cited By
The Query Complexity of a Permutation-Based Variant of Mastermind

The Query Complexity of a Permutation-Based Variant of Mastermind

20 December 2018
P. Afshani
Manindra Agrawal
Benjamin Doerr
Carola Doerr
Kasper Green Larsen
K. Mehlhorn
    LRM
ArXivPDFHTML

Papers citing "The Query Complexity of a Permutation-Based Variant of Mastermind"

4 / 4 papers shown
Title
Complexity Theory for Discrete Black-Box Optimization Heuristics
Complexity Theory for Discrete Black-Box Optimization Heuristics
Carola Doerr
18
28
0
06 Jan 2018
The (1+1) Elitist Black-Box Complexity of LeadingOnes
The (1+1) Elitist Black-Box Complexity of LeadingOnes
Carola Doerr
Johannes Lengler
18
13
0
08 Apr 2016
Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes
Black-Box Complexity: Breaking the O(nlog⁡n)O(n \log n)O(nlogn) Barrier of LeadingOnes
Benjamin Doerr
Carola Doerr
48
16
0
24 Oct 2012
Faster Black-Box Algorithms Through Higher Arity Operators
Faster Black-Box Algorithms Through Higher Arity Operators
Benjamin Doerr
Daniel Johannsen
Timo Kotzing
Per Kristian Lehre
Markus Wagner
Carola Doerr
53
65
0
04 Dec 2010
1