Determination of a Subset from Certain Combinatorial Properties

DOI10.4153/CJM-1966-007-2zbMath0201.33802MaRDI QIDQ5599181

No author found.

Publication date: 1966

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Related Items (23)

Kolmogorov complexity arguments in combinatorics ⋮ Search problems on graphs ⋮ Combinatorics of separation by binary matrices ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Random and quasi-random designs in group testing ⋮ On inverse mappings of residue class representing sum-distinct sets obtained from hadamard matrices ⋮ A ternary search problem on graphs ⋮ On the dimension of additive sets ⋮ Low complexity inverse mappings on sum-distinct elements of a power set ⋮ On metric dimension of nonbinary Hamming spaces ⋮ 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 ⋮ Some Completeness Results on Decision Trees and Group Testing ⋮ Signature codes for noisy multiple access adder channel ⋮ Unnamed Item ⋮ An information-theoretic method in combinatorial theory ⋮ A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem ⋮ Toward a deterministic polynomial time algorithm with optimal additive query complexity ⋮ Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping ⋮ Optimal Detection of Two Complementary Defectives ⋮ On metric dimensions of hypercubes ⋮ On error correction with errors in both the channel and syndrome

This page was built for publication: Determination of a Subset from Certain Combinatorial Properties