|
|
|
|
|
Daniel Gibney and Sharma V. Thankachan
Finding substrings of a text T that match a regular expression p is a fundamental problem. Despite being the subject of extensive research, no solution with a time complexity significantly better than ??(|??||??|)
O
(
|
T
|
|
p
|
)
has been found. Backu...
ver más
|
|
|
|
|