Communications of the ACM
Refine your search:
How the “Frontier” Became the Slogan of Uncontrolled AI
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration …
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
Does the Physics Nobel Prize Winner understand their own work (guest post)
David Marcus was a Math major a year ahead of my at SUNY Stonybrook (he graduated in 1979,I graduated in 1980). He then got a PhD from MIT in Math, and is a reader...
From Computational Complexity
The Media Coverage of the Matrix result is Terrible (though not worse than usual)
BILL: A computer program (or an AI or an ML or whatever) found a BETTER way to do matrix mult! Its in the same spirit as Strassen. I've always wondered if Strassen...
From Computational Complexity
BYTE LYNX- an awesome video game/Am I an influencer?
Tucker Bane is a friend of mine who has an AWESOME video game availablethat is called BYTE LYNX.I am curious- Can I be an INFLUENCER!Lets find out!At the link below...
From Computational Complexity
Will Strassen's Matrix Mult Alg ever be practical?
All time bounds are asymptotic and really O-of.Recall that Strassen found a clever way to multiple two 2x2 matrices with 7 mults (and lots of adds) leading tohere...
From Computational Complexity
Is it okay for a paper or book to say `for more on this topic see Wikipedia Entry BLAH.
One of the proofreaders for Computational Intractability: A Guide to Algorithmic Lower Bounds(available here)made the following objection, which raises some questions...
From Computational Complexity
Is the complexity of approximating Vertex Cover of degree 3 open?
RECALL:A max-problem f has a A P Time App Scheme (PTAS) if there is an algorithm ALG such that ALG(\epsilon) \ge (1-\epsilon)f(x).A min-problem f has a A P Time...
From Computational Complexity
POSTED UPDATED VERSION OF Computers and Intractability: A guide to Algorithmic Lower Bounds posted (New title)
We have posted a revised version of Computational Intractability: A Guide to Algorithmic Lower Boundsby Demaine-Gasarch-HajiaghayiThe book is here.(For the original...
From Computational Complexity
There are two different definitions of Integer Programming. Why?
Alice and Bob have the following conversation.===============================ALICE: In your book you define INT PROG as, given a matrix A and vectors b,c,find the...
From Computational Complexity
Monarachy: A Problem with Definitions
As I am sure you know, Queen Elizabeth II passed away at the age of 96 recently. I am not a royal-watcher, but I am a royal-watcher-watcher. That is, the question...
From Computational Complexity
Computers and Intractability: A Guide to Algorithmic Lower Bounds. First draft available! Comments Welcome!
(This post is written by Erik Demaine, William Gasarch, and Mohammad Hajiaghayi)In 1979 Garey and Johnson published the classic Computers and Intractability...
From Computational Complexity
A non-controversial question about the Documents Donald Trump had in his house
This is a non-partisan post. In the interest of disclosure I will divulge that I do not think private citizens should have top secret government documents in their...
From Computational Complexity
The Held Prize for comb. opt. AND Disc Opt AND Alg AND Complexity theory AND related parts of CS.
Dan Spielman asked me to blog about the Held Prize. I first present what he send me, and then have some thoughts.FROM DAN: ------------------------------------...
From Computational Complexity
Juris Hartmanis passed away on July 29 at the age of 94
Juris Hartmanis, one of the founders of Complexity Theory, passed away on July 29 at the age of 94. The Gödel's Last Letter blog has an obit posted here. When...
From Computational Complexity
100 Best Number Theory books of all Time---except many are not on Number Theory
I was recently emailed this link: 100 Best Number Theory books of all Time That sounds like a good list to have! But then I looked at it. The issue IS NOT that...
From Computational Complexity
What is known about that sequence
In my last post I wrote:---------------------------Consider the recurrencea_1=1for all n\ge 2, a_n = a_{n-1} + a_{n/2}.For which M does this recurrence have infinitely...
From Computational Complexity
An open question about a sequence mod M.
In this post n/2 means floor{n/2}Consider the recurrencea_1=1for all n\ge 2, a_n = a_{n-1} + a_{n/2}.For which M does this recurrence have infinitely many n such...
From Computational Complexity