Computational and proof complexity of partial string avoidability.
Dmitry ItsyksonAlexander OkhotinVsevolod OparinPublished in: Electron. Colloquium Comput. Complex. (2020)
Keyphrases
- complexity analysis
- data structure
- data mining
- computational power
- website
- mathematical programming
- real time
- computational models
- worst case
- mathematical proofs
- binary strings
- context free grammars
- theorem proving
- regular expressions
- edit distance
- case study
- knowledge base
- artificial intelligence
- genetic algorithm
- neural network
- databases