The query complexity of a permutation-based variant of mastermind (Q1741495): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2904757015
@@ Property / OpenAlex ID: W2904757015 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08480
@@ Property / arXiv ID: 1812.08480 / rank @@
+Normal rank
@@ Property / cites work @@
+The Query Complexity of Finding a Hidden Permutation
+Normal rank
@@ Property / cites work @@
+Mastermind
@@ Property / cites work: Mastermind / rank @@
+Normal rank
@@ Property / cites work @@
+Playing Mastermind With Many Colors
@@ Property / cites work: Playing Mastermind With Many Colors / rank @@
+Normal rank
@@ Property / cites work @@
+Faster black-box algorithms through higher arity operators
+Normal rank
@@ Property / cites work @@
+The \((1+1)\) elitist black-box complexity of LeadingOnes
+Normal rank
@@ Property / cites work @@
+On the analysis of the \((1+1)\) evolutionary algorithm
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for randomized search heuristics in black-box optimization
+Normal rank
@@ Property / cites work @@
+Q5731202
@@ Property / cites work: Q5731202 / rank @@
+Normal rank
@@ Property / cites work @@
+Black-box search by unbiased variation
@@ Property / cites work: Black-box search by unbiased variation / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1741495