4 ms·
If you didn't read the paper, at least read the title: "unsolvable" does not mean NP hard
by zodiac 8y ago
If you didn't read the paper, at least read the title: "unsolvable" does not mean NP hard
- chaboud 8y agoI did read the paper (now). Their question is of “learnability”, which relates to aggregability/compressibility and dimensionality. This stuff is all in the same ballpark. Having read their paper, I do appreciate the formulation and approach. I just don’t find the result “surprising” in the slightest.