3 ms·Nope, it's basic regex so not NP-hard.by ladberg 6y agoNope, it's basic regex so not NP-hard.teawrecks 6y agoBut it's a satisfiability problem. Seems NP-complete in the general case to me.ladberg 6y agoHuh yeah that could be right... I'll have to think about it more.