Determination of a Subset from Certain Combinatorial Properties
From MaRDI portal
Cited in
(25)- Search problems on graphs
- Combinatorics of separation by binary matrices
- A ternary search problem on graphs
- An information-theoretic method in combinatorial theory
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Kolmogorov complexity arguments in combinatorics
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
- Random and quasi-random designs in group testing
- On metric dimension of nonbinary Hamming spaces
- On the metric dimension of Cartesian powers of a graph
- On error correction with errors in both the channel and syndrome
- Exact learning from an honest teacher that answers membership queries
- On the dimension of additive sets
- Some Completeness Results on Decision Trees and Group Testing
- Low complexity inverse mappings on sum-distinct elements of a power set
- On inverse mappings of residue class representing sum-distinct sets obtained from hadamard matrices
- Optimal Detection of Two Complementary Defectives
- Tight complexity lower bounds for integer linear programming with few constraints
- Signature codes for noisy multiple access adder channel
- On metric dimensions of hypercubes
- Optimal schemes for combinatorial query problems with integer feedback
- Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
- Mastermind with a linear number of queries
- Learning partitions using rank queries
- Toward a deterministic polynomial time algorithm with optimal additive query complexity
This page was built for publication: Determination of a Subset from Certain Combinatorial Properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5599181)
