scientific article; zbMATH DE number 3194843
From MaRDI portal
Publication:5731202
Recommendations
Cited in
(50)- Computing minimal doubly resolving sets of graphs
- Combinatorics of separation by binary matrices
- Probabilistic existence theorems in group testing
- Mathematical studies of the information in the stimulus-response matrix
- Uniquely identifying the edges of a graph: the edge metric dimension
- On the query complexity of black-peg AB-mastermind
- Symmetry properties of resolving sets and metric bases in hypercubes
- Query complexity of mastermind variants
- The query complexity of a permutation-based variant of mastermind
- Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
- Existence theorems for some group testing strategies
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
- Solving static permutation mastermind using \(O(n \log n)\) queries
- Generalized framework for group testing: queries, feedbacks and adversaries
- A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions
- Random and quasi-random designs in group testing
- On metric dimension of nonbinary Hamming spaces
- The exact query complexity of yes-no permutation mastermind
- Reducing the arity in unbiased black-box complexity
- Playing mastermind with constant-size memory
- Unbiasedness of estimation-of-distribution algorithms
- Bounding memory for Mastermind might not make it harder
- Identifying codes and searching with balls in graphs
- \textsc{OneMax} in black-box models with several restrictions
- On the metric dimension of Cartesian powers of a graph
- Resolving the hypercube
- On the strong metric dimension of tetrahedral diamond lattice
- Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
- Metric dimension for amalgamations of graphs
- Bounds for the number of tests in non-adaptive randomized algorithms for group testing
- scientific article; zbMATH DE number 3880583 (Why is no real title available?)
- Some Completeness Results on Decision Trees and Group Testing
- The unbiased black-box complexity of partition is polynomial
- Optimal Detection of Two Complementary Defectives
- From black-box complexity to designing new genetic algorithms
- Signature codes for noisy multiple access adder channel
- Philosophical issues in Kolmogorov complexity
- Ranking-based black-box complexity
- scientific article; zbMATH DE number 3205803 (Why is no real title available?)
- scientific article; zbMATH DE number 7589564 (Why is no real title available?)
- Optimal 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
- 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
- Mastermind with a linear number of queries
- Optimal strategies for the static black-peg AB game with two and three pegs
- Top-k combinatorial bandits with full-bandit feedback
- Memory-restricted black-box complexity of OneMax
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5731202)
