6 citations · 9 across the 11 of their papers we have counts for
1 paper · 2 filters
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier +2
In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The k-PATS problem…