|
Volumn 20, Issue 6, 1991, Pages 1008-1020
|
On the exact complexity of string matching. Lower bounds
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTER PROGRAMMING - ALGORITHMS;
ONLINE ALGORITHMS;
STRING MATCHING;
COMPUTER METATHEORY;
|
EID: 0026368175
PISSN: 00975397
EISSN: None
Source Type: Journal
DOI: 10.1137/0220063 Document Type: Article |
Times cited : (24)
|
References (6)
|