An experiment with 2,520 participants backs Richard Feynman’s answer to every diner’s dilemma: do I want to try something new ...

A seemingly simple set of rules kicks off a kind of mathematical magic trick, which has kept great minds busy since the 1930s ...

In 1946, the mathematician Paul Erdős posed the unit distance problem—and suggested a winning strategy. An A.I. model has now ...

A 10-member committee offered a brutal assessment of academia’s role in creating the forces challenging American colleges and universities. By Alan Blinder American colleges and universities bear ...

NP-complete for general graphs APX-hard: difficult to approximate within a constant factor Generalizes well-known problems such as maximum clique and subgraph isomorphism ...

Timely reconstruction of epidemic dynamics is essential for public health, and structured coalescent models constitute an essential tool for this purpose. However, statistical and computational ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

Abstract: Network Function Virtualization (NFV) has the potential for cost-efficiency, manage-convenience, and flexibility services but meanwhile poses challenges for the service function chain (SFC) ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Abstract: In applied and numerical algebraic geometry, many problems are reduced to computing an approximation to a real algebraic curve. In order to elevate the results of such a computation to the ...