The following pages link to Mastermind (Q753814):
Displaying 50 items.
- Metric dimension of some distance-regular graphs (Q358647) (← links)
- The fractional metric dimension of graphs (Q411666) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- Ranking-based black-box complexity (Q528852) (← links)
- Guessing bank PINs by winning a mastermind game (Q692940) (← links)
- Bounds on the domination number and the metric dimension of co-normal product of graphs (Q824651) (← links)
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- On the algorithmic complexity of the Mastermind game with black-peg results (Q989451) (← links)
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- Sharp bounds for partition dimension of generalized Möbius ladders (Q1738248) (← links)
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- On the metric dimension of incidence graphs (Q1744744) (← links)
- The weighted 2-metric dimension of trees in the non-landmarks model (Q1751125) (← links)
- On the metric dimension of infinite graphs (Q1759836) (← links)
- The number of pessimistic guesses in generalized black-peg mastermind (Q1944171) (← links)
- The fractional metric dimension of permutation graphs (Q2018874) (← links)
- Computation of the double metric dimension in convex polytopes (Q2051724) (← 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)
- On metric dimension of plane graphs with \(\frac{m}{2}\) number of 10 sided faces (Q2082171) (← links)
- Completeness-resolvable graphs (Q2115145) (← links)
- Resolving sets tolerant to failures in three-dimensional grids (Q2167827) (← links)
- On metric dimension of nonbinary Hamming spaces (Q2190917) (← links)
- Fault-tolerant metric dimension of generalized wheels and convex polytopes (Q2214773) (← links)
- On the geodesic identification of vertices in convex plane graphs (Q2217853) (← links)
- The exact query complexity of yes-no permutation mastermind (Q2221264) (← links)
- On the upper bounds of fractional metric dimension of symmetric networks (Q2230062) (← links)
- Reducing the arity in unbiased black-box complexity (Q2251000) (← links)
- Playing mastermind with constant-size memory (Q2254508) (← links)
- An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system (Q2255222) (← links)
- The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) (Q2285139) (← links)
- On the metric dimension of the folded \(n\)-cube (Q2300649) (← links)
- Low-dimensional representation of genomic sequences (Q2311893) (← links)
- Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes (Q2333632) (← links)
- The worst case number of questions in generalized AB game with and without white-peg answers (Q2341748) (← links)
- Computing the metric dimension for chain graphs (Q2346556) (← links)
- Bounding memory for Mastermind might not make it harder (Q2355703) (← links)
- The \(k\)-metric dimension (Q2410025) (← links)
- On the metric dimension of Cartesian powers of a graph (Q2424901) (← links)
- On the strong metric dimension of tetrahedral diamond lattice (Q2516507) (← links)
- Minimum partition of an \(r\)-independence system (Q2666441) (← links)
- Metric dimension and edge metric dimension of windmill graphs (Q2670993) (← links)
- Partition dimension of COVID antiviral drug structures (Q2688749) (← links)
- On graphs of order \(n\) with metric dimension \(n-4\) (Q2689112) (← links)
- On the Metric Dimension of Infinite Graphs (Q2840509) (← links)
- The Query Complexity of Finding a Hidden Permutation (Q2848962) (← links)
- Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory (Q2946054) (← links)
- An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs (Q2958353) (← links)
