The following pages link to On \(B_ 2\)-sequences of vectors (Q2551781):
Displayed 14 items.
- Signature codes for noisy multiple access adder channel (Q510479) (← links)
- Sidon sets in \(\mathbb N^d\) (Q986121) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Search problems on graphs (Q1082080) (← links)
- A ternary search problem on graphs (Q1118418) (← links)
- Search problems: One, two or many rounds (Q1344611) (← links)
- On sum sets of Sidon sets. II (Q1895079) (← links)
- A note on \(\overline{2} \)-separable codes and \(B_2\) codes (Q2065925) (← links)
- Improved upper bounds for parent-identifying set systems and separable codes (Q2220762) (← links)
- On the number of divisors which are values of a polynomial (Q2269011) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (Q4903279) (← links)
- Binary \(B_2\)-sequences: a new upper bound (Q5937131) (← links)
- Recovering affine linearity of functions from their restrictions to affine lines (Q6083970) (← links)