this will not be funny to many

[trochee]

Labmate just summarized a paper: "the naive algorithm is O(2ⁿ). He spends 10 pages explaining how his algorithm is O(1.9601ⁿ)."

My answer: "So if n is large, it's intractable anyway, and if n is small, it doesn't matter anyway."

"Basically, yeah."

I'm glad it's not me trying to justify that paper to the reading group.

Comments

[marnanel.livejournal.com]

(which was probably your friend's point, I suppose.)