Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin. Computational and proof complexity of partial string avoidability. Electronic Colloquium on Computational Complexity (ECCC), 27:67, 2020. [doi]
@article{ItsyksonOO20,
title = {Computational and proof complexity of partial string avoidability},
author = {Dmitry Itsykson and Alexander Okhotin and Vsevolod Oparin},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/067},
researchr = {https://researchr.org/publication/ItsyksonOO20},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {27},
pages = {67},
}