With the aid of sticker model, the minimal set covering problem can be solved by transforming the subset to memory complex and utilizing the massive parallelism of sticking operations.

• 在粘贴模型中，用存储复合体来表示子集，并利用粘贴运算的巨大并行性，可以有效地求解最小集合覆盖问题。