Bichromatic Hamming Close Pair: Revision history

10 April 2023

• curprev 09:2809:28, 10 April 2023‎ Admin talk contribs‎ 1,893 bytes +6‎ No edit summary

15 February 2023

• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 1,887 bytes −9‎ No edit summary

• curprev 11:3011:30, 15 February 2023‎ Admin talk contribs‎ 1,896 bytes +1,896‎ Created page with "{{DISPLAYTITLE:Bichromatic Hamming Close Pair (Bichromatic Hamming Close Pair)}} == Description == Given two sets $A = \{a_1, \ldots, a_n\} \subseteq \{0, 1\}^d$ and $B = \{b_1, \ldots, b_n\} \subseteq \{0, 1\}^d$ of $n$ binary vectors and an integer $t \in \{2, \ldots, d\}$, decide if there exists a pair $a \in A$ and $b \in B$ such that the number of coordinates in which they differ is less than $t$ (formally, $Hamming(a, b) := |a − b|1 < t$). If there is such a pa..."