zlacker

This might deserve some context here from experts. Wouldn’t solving mistake finding, in the general case, be the same as solving SAT (NP-Hard)?

From the abstract it sounds to me like they’re talking about heuristics for particular problems. Is that accurate?

>>agentu+(OP)
Computational complexity isn’t really related here. Complexity has to do with formal languages and asymptotics, this is about natural language and fixed size data sets.