[Editor’s Note: This is the next part in our series on the Millennium Problems.] This is a problem in the area of computational complexity which deals with efficiency of algorithms. An alphabet A is a finite nonempty set of symbols and a computational problem over A is simply a