Computational and Proof Complexity of Partial String Avoidability.

Dmitry Itsykson Alexander Okhotin Vsevolod Oparin

Published in: MFCS (2016)

Keyphrases

complexity analysis
data structure
memory requirements
website
multi agent systems
computational complexity
edit distance
worst case
pattern matching
decision problems
theorem proving
space complexity
string matching
partial information
linear logic