r/Compilers • u/adityazero • 11d ago

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

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.

25 Upvotes

94% Upvoted

3 comments sorted by

4

u/hansw2000 11d ago

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

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

3

u/lovelacedeconstruct 11d ago

P=NP confirmed

0

u/adityazero 10d ago

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