[UVA] 552 - Filling the Gaps
Filling the Gaps
At the largest conference on coding and cryptography the following theorem
needed a proof or a counterexample: Suppose you are given a set of words
of equal length; each word consisting of 0's, 1's and/or *'s. Furthermore
suppose the p...
