Partial Match: Revision history

10 April 2023

• curprev 09:2709:27, 10 April 2023‎ Admin talk contribs‎ 1,585 bytes +4‎ No edit summary

15 February 2023

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

• curprev 11:2811:28, 15 February 2023‎ Admin talk contribs‎ 1,591 bytes +1,591‎ Created page with "{{DISPLAYTITLE:Partial Match (Partial Match)}} == Description == In the Partial Match problem, we are given a "database" of $n$ binary strings, and a list of $n$ "queries" which are strings in $\{0,1,?\}^*$. (Here, "?" represents a wildcard.) We say that a query $q=q_1,...,q_d$ matches a string $x=x_1,...,x_d$ if for all $i=1,...,d$, if $q_i$ in $\{0,1\}$ then $q_i = x_i$. Output: Determine for all $n$ queries, which of them match some string in the database. == Param..."