Hartarsky, Ivailo and Mezei, Tamás Róbert (2020) Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness. SIAM JOURNAL ON DISCRETE MATHEMATICS, 34 (2). pp. 1444-1459. ISSN 0895-4801
|
Text
NP_hardness_of_bootstrap.pdf Download (608kB) | Preview |
Official URL: https://doi.org/10.1137/19M1239933
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 24 Sep 2020 07:23 |
| Last Modified: | 24 Sep 2020 07:23 |
| URI: | http://real.mtak.hu/id/eprint/114342 |
Actions (login required)
 |
Edit Item |
