Conversation
If you’re talking about randomized algorithms beating deterministic in higher dimensions for NP problems, I’ve cited the idea a few times. It’s a well-known idea. I don’t know of a canonical reference. Google ‘curse of dimensionality.’ Here’s an example. jstor.org/stable/2171751
1
1
Possibly this on breaking smart, not ribbonfarm

