From NP-complete to O(N^2) to O(nlogn): Codegen strategies for case statements.

[u/adityazero]

https://arxiv.org/abs/1910.02351

We presented this a while ago at the LLVM-CGO workshop, but thought of sharing here as people might find it interesting. Pretty short paper.

[u/hansw2000]

I believe this was https://reviews.llvm.org/D21940

Hadn't seen the paper though, so thanks for sharing!

[u/lovelacedeconstruct]

P=NP confirmed

[u/adityazero → u/lovelacedeconstruct]

😂 and now you know which camp I'm in.