The study of computable algebraic structures lies at the intersection of algebra, computer science and complexity theory. At its core, this field investigates how abstract algebraic systems can be ...

Seventy years after the invention of a data structure called a hash table, theoreticians have found the most efficient possible configuration for it. About 70 years ago, an engineer at IBM named Hans ...

I would not give a fig for the simplicity this side of complexity, but I would give my life for the simplicity on the other side of complexity.” — Olliver Wendell Holmes We seem to appreciate simple ...