Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
burgerbrain
on Jan 20, 2012
|
parent
|
context
|
favorite
| on:
Approximate Regex Matching in Python
O(M^(2N)) would get absolutely ludicrous pretty damn quick.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
