More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
Information and Computation
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Let sleeping files lie: pattern matching in Z-compressed files
Journal of Computer and System Sciences
Finite Monoids: From Word to Circuit Evaluation
SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Complexity of Language Recognition Problems for Compressed Words
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Regular expression searching on compressed text
Journal of Discrete Algorithms
A PTIME-complete matching problem for SLP-compressed words
Information Processing Letters
Word Problems and Membership Problems on Compressed Words
SIAM Journal on Computing
IEEE Transactions on Information Theory
Parameterized Complexity
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Theoretical Computer Science
Computing longest common substring and all palindromes from compressed strings
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Fast distance multiplication of unit-Monge matrices
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Leaf languages and string compression
Information and Computation
Compressed membership in automata with compressed labels
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Towards approximate matching in compressed strings: local subsequence recognition
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Faster subsequence and don't-care pattern matching on compressed texts
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Faster fully compressed pattern matching by recompression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
The computational complexity of two simple string problems on compressed input strings is considered: the querying problem (What is the symbol at a given position in a given input string?) and the embedding problem (Can the first input string be embedded into the second input string?). Straight-line programs are used for text compression. It is shown that the querying problem becomes P-complete for compressed strings, while the embedding problem becomes hard for the complexity class $\Theta^{p}_{2}$.