Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many teaspoons in a tablespoon? For questions like these, they’ve got ...

The traveling salesman problem is one of the basic problems that many theoretical computer scientists have been working on. Many scientists think that there is no algorithm for the traveling salesman ...

Nathan Klein receives funding from the National Science Foundation. Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many ...