• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Computational and Proof Complexity of Partial String Avoidability.

Dmitry ItsyksonAlexander OkhotinVsevolod Oparin
Published in: ACM Trans. Comput. Theory (2021)
Keyphrases
  • complexity analysis
  • case study
  • computational complexity
  • theorem proving
  • data sets
  • information systems
  • multiscale
  • data structure
  • computational cost
  • pattern matching
  • regular expressions
  • computational power