Recent decades have witnessed remarkable progress in the study of Boolean satisfiability – the problem of determining whether a given propositional formula can be satisfied – and its natural extension ...

Feeling guilty about the hours you’ve wasted on Candy Crush Saga? Relax. A mathematical analysis of the notoriously addictive video game reveals that it belongs to a class of fiendish computational ...

Last summer, three researchers took a small step toward answering one of the most important questions in theoretical computer science. To paraphrase Avi Wigderson of the Institute for Advanced Study, ...

Imagine a parallel universe where physicists are remunerated so handsomely that they can accumulate multitudinous assets. In this alternate universe, you naturally wish to share your good fortune, so ...