default search action
"Computational and proof complexity of partial string avoidability."
Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin (2020)
- Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and proof complexity of partial string avoidability. Electron. Colloquium Comput. Complex. TR20 (2020)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.