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 (2016)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2016.51

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/ItsyksonOO16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/ItsyksonOO16
Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and Proof Complexity of Partial String Avoidability. MFCS 2016: 51:1-51:13

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.