Determination of two vectors from the sum
From MaRDI portal
Publication:5556461
DOI10.1016/S0021-9800(69)80038-4zbMath0169.32001MaRDI QIDQ5556461
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (20)
Search problems on graphs ⋮ Search problems: One, two or many rounds ⋮ On sum sets of Sidon sets. II ⋮ Extremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-Graphs ⋮ Random and quasi-random designs in group testing ⋮ A ternary search problem on graphs ⋮ Minkowski Complexity of Sets: An Easy Lower Bound ⋮ A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$ ⋮ Near-sunflowers and focal families ⋮ Applications of coding theory to communication combinatorial problems ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ Binary \(B_2\)-sequences: a new upper bound ⋮ Remarks on a generalization of the Davenport constant ⋮ A better bound for locally thin set families ⋮ An Upper Bound on the Sizes of Multiset-Union-Free Families ⋮ Approximation Limitations of Pure Dynamic Programming ⋮ Tropical Complexity, Sidon Sets, and Dynamic Programming ⋮ On \(B_ 2\)-sequences of vectors ⋮ Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping ⋮ Sidon sets in groups and induced subgraphs of Cayley graphs
This page was built for publication: Determination of two vectors from the sum
