scientific article; zbMATH DE number 1336330
From MaRDI portal
Publication:4258669
Recommendations
Cited in
(22)- Total palindrome complexity of finite words
- The invariant problem for binary string structures and the parallel complexity theory of queries
- Topology of strings: median string is NP-complete
- Algorithms for subsequence combinatorics
- Sublinear algorithms for approximating string compressibility
- Non-standard stringology: algorithms and complexity
- Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
- On the Polynomial Depth of Various Sets of Random Strings
- scientific article; zbMATH DE number 4085051 (Why is no real title available?)
- Versatile string kernels
- On the Varshamov-Tenengolts construction on binary strings
- scientific article; zbMATH DE number 1091206 (Why is no real title available?)
- A linearly computable measure of string complexity
- scientific article; zbMATH DE number 1747450 (Why is no real title available?)
- scientific article; zbMATH DE number 6851884 (Why is no real title available?)
- On Hardness of Several String Indexing Problems
- On Simon's congruence closure of a string
- Frequency-constrained substring complexity
- On the complexity of learning strings and sequences
- On average sequence complexity
- The string guessing problem as a method to prove lower bounds on the advice complexity
- Two-pattern strings. II: Frequency of occurrence and substring complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258669)
