On a Combinatorial Problem in Number Theory
From MaRDI portal
Publication:5339312
DOI10.4153/CMB-1965-034-2zbMath0131.01303MaRDI QIDQ5339312
Publication date: 1965
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items (22)
Binary trees and uniform distribution of traffic cutback ⋮ Kolmogorov complexity arguments in combinatorics ⋮ Combinatorics of separation by binary matrices ⋮ Exact learning from an honest teacher that answers membership queries ⋮ 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 ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ Resolving the hypercube ⋮ Distribution of the sum-of-digits function of random integers: a survey ⋮ Some Completeness Results on Decision Trees and Group Testing ⋮ Minimal Embedding Dimensions of Rectangle k-Visibility Graphs ⋮ 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 Parity Check (0,1)-Matrix over $\mathbb{Z}_p$ ⋮ On metric dimensions of hypercubes
This page was built for publication: On a Combinatorial Problem in Number Theory
