Title of article
A PTIME-complete matching problem for SLP-compressed words
Author/Authors
N. Markey، نويسنده , , Ph. Schnoebelen، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
4
From page
3
To page
6
Keywords
Pattern-matching , Compressed strings , complexity , Algorithms
Journal title
Information Processing Letters
Serial Year
2004
Journal title
Information Processing Letters
Record number
129873
Link To Document