Communications of the ACM
Refine your search:
Generic number compression (zstd)
I have done a lot of work that involves compressing and uncompressing data. Most often, I work on data that has specific characteristics…
From Computational Complexity
Would you be more productive if you didn't log on? It worked for Christopher Havens!
There are times when NOT having computer access (is that possible anymore?) can make you MORE productive. 1) I did a lot of my Muffin Work when I was in MexicoTexas...
From Computational Complexity
Who first thought of the notion of Polynomial Time?
(Updated version of Computational Intractability: A Guide to Algorithmic Lower Bound by Demaine-Gasarch-Hajiaghayi is here)Any question like who first though of...
From Computational Complexity
Euclidean TSP is NP-hard but not known to be in NP. Why not known?
BILL: Lance, I was looking into TSP, metric TSP, Euclidean TSP since I am going to teach about P, NP, NPC, and approximating NPC problems and I came across theThe...
From Computational Complexity