Determination of a Subset from Certain Combinatorial Properties

DOI10.4153/CJM-1966-007-2zbMATH Open0201.33802MaRDI QIDQ5599181FDOQ5599181

Authors:

Publication date: 1966

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

Cited In (24)

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

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)