The following pages link to (Q5731202):
Displaying 43 items.
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- From black-box complexity to designing new genetic algorithms (Q487994) (← links)
- Signature codes for noisy multiple access adder channel (Q510479) (← links)
- Ranking-based black-box complexity (Q528852) (← links)
- Memory-restricted black-box complexity of OneMax (Q763484) (← links)
- Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
- Probabilistic existence theorems in group testing (Q1395870) (← links)
- Uniquely identifying the edges of a graph: the edge metric dimension (Q1627862) (← links)
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- Symmetry properties of resolving sets and metric bases in hypercubes (Q1677292) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm (Q1750362) (← links)
- Existence theorems for some group testing strategies (Q1817291) (← links)
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem (Q2065777) (← links)
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
- Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
- A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions (Q2144272) (← links)
- Random and quasi-random designs in group testing (Q2156803) (← links)
- On metric dimension of nonbinary Hamming spaces (Q2190917) (← links)
- The exact query complexity of yes-no permutation mastermind (Q2221264) (← links)
- Reducing the arity in unbiased black-box complexity (Q2251000) (← links)
- Playing mastermind with constant-size memory (Q2254508) (← links)
- Unbiasedness of estimation-of-distribution algorithms (Q2315013) (← links)
- Bounding memory for Mastermind might not make it harder (Q2355703) (← links)
- Identifying codes and searching with balls in graphs (Q2355743) (← links)
- \textsc{OneMax} in black-box models with several restrictions (Q2362361) (← links)
- On the metric dimension of Cartesian powers of a graph (Q2424901) (← links)
- Resolving the hypercube (Q2446831) (← links)
- On the strong metric dimension of tetrahedral diamond lattice (Q2516507) (← links)
- Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory (Q2946054) (← links)
- Metric Dimension for Amalgamations of Graphs (Q2946069) (← links)
- Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing (Q3297759) (← links)
- Some Completeness Results on Decision Trees and Group Testing (Q3801062) (← links)
- Optimal Detection of Two Complementary Defectives (Q4745828) (← links)
- Philosophical issues in Kolmogorov complexity (Q5204301) (← links)
- (Q5866382) (← links)
- Optimal group testing (Q5886113) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
- On mixed metric dimension of crystal cubic carbon structure (Q6081443) (← links)
- Optimal schemes for combinatorial query problems with integer feedback (Q6138906) (← links)
- Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory (Q6173473) (← links)
- Choosing the right algorithm with hints from complexity theory (Q6178456) (← links)
