Re:Approximate Regex Matching in Python
by Wilduck on Friday January 20, 2012 @12:45PM
(#3490333)
Wow, I'm glad you linked to that article, otherwise I would have thought the complexity was O(M^(2N)) instead of O((M^2)N). Although, the fact that I almost mistook that complexity means I should probably spend some time learning about how regular expressions are implemented. Thanks for the link.
[ Parent
| on HN ]
Re:Approximate Regex Matching in Python
by burgerbrain on Friday January 20, 2012 @06:50PM
(#3491843)
O(M^(2N)) would get absolutely ludicrous pretty damn quick.