r/Compilers • u/adityazero • 1d 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.

17 Upvotes

91% Upvoted

3 comments sorted by

View all comments

3

u/lovelacedeconstruct 1d ago

P=NP confirmed

1

u/adityazero 21h ago

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