scientific article; zbMATH DE number 3194843
From MaRDI portal
Publication:5731202
zbMath0119.34001MaRDI QIDQ5731202
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (43)
\textsc{OneMax} in black-box models with several restrictions ⋮ Optimal group testing ⋮ Uniquely identifying the edges of a graph: the edge metric dimension ⋮ Generalized framework for group testing: queries, feedbacks and adversaries ⋮ A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions ⋮ On the query complexity of black-peg AB-mastermind ⋮ Random and quasi-random designs in group testing ⋮ Symmetry properties of resolving sets and metric bases in hypercubes ⋮ Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory ⋮ Metric Dimension for Amalgamations of Graphs ⋮ Probabilistic existence theorems in group testing ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ On mixed metric dimension of crystal cubic carbon structure ⋮ Unnamed Item ⋮ On metric dimension of nonbinary Hamming spaces ⋮ Query complexity of mastermind variants ⋮ On the metric dimension of Cartesian powers of a graph ⋮ Optimal schemes for combinatorial query problems with integer feedback ⋮ Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory ⋮ Choosing the right algorithm with hints from complexity theory ⋮ The unbiased black-box complexity of partition is polynomial ⋮ Resolving the hypercube ⋮ Some Completeness Results on Decision Trees and Group Testing ⋮ The exact query complexity of yes-no permutation mastermind ⋮ Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing ⋮ From black-box complexity to designing new genetic algorithms ⋮ The query complexity of a permutation-based variant of mastermind ⋮ Signature codes for noisy multiple access adder channel ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Reducing the arity in unbiased black-box complexity ⋮ Ranking-based black-box complexity ⋮ Playing mastermind with constant-size memory ⋮ Philosophical issues in Kolmogorov complexity ⋮ On the strong metric dimension of tetrahedral diamond lattice ⋮ Computing minimal doubly resolving sets of graphs ⋮ Existence theorems for some group testing strategies ⋮ A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem ⋮ Memory-restricted black-box complexity of OneMax ⋮ Unbiasedness of estimation-of-distribution algorithms ⋮ Solving static permutation mastermind using \(O(n \log n)\) queries ⋮ Optimal Detection of Two Complementary Defectives ⋮ Bounding memory for Mastermind might not make it harder ⋮ Identifying codes and searching with balls in graphs
This page was built for publication:
