Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Computational and Proof Complexity of Partial String Avoidability."

Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin (2021)

> Home

Details and statistics

DOI: 10.1145/3442365

access: closed

type: Journal Article

metadata version: 2021-04-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/ItsyksonOO21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/ItsyksonOO21
Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and Proof Complexity of Partial String Avoidability. ACM Trans. Comput. Theory 13(1): 6:1-6:25 (2021)

a service of

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.