Approximate Competitive Equilibrium from Equal Incomes (A-CEEI) is an equilibrium-based solution concept for fair division of discrete items to agents with combinatorial demands. In theory, it is ...

Quantum computers show great promise because they could, at least in principle, solve certain problems that cannot be cracked even by the most powerful conventional supercomputers. But building ...

For decades, the graph isomorphism problem has held a special status within complexity theory. While thousands of other computational problems have meekly succumbed to categorization as either hard or ...

Google is putting its supreme algorithm to work. In October, the company announced that they had reached quantum supremacy – the point at which a quantum computer can complete a task that no classical ...