In today's blog, I'll introduce the concept of fingerprinting algorithms. The premise of fingerprinting is simple. Suppose that you have two objects, $x$ and $y$, and you want to quickly verify if $x = y$. If $x, y$ are drawn from some universe $U$, to determine whether $x = y$ one could . . .

##Introduction Problem. Suppose you are in a room with $n$ lightbulbs and $k$ switches, where $1 \leq n$ and $1 \leq k$. Suppose that any particular switch turns a subset of light bulbs on. Find the minimum number of switches such that flipping them on turns on all of the . . .