The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest. “In Laci Babai, you have one of the most legendary and fearsome theoretical computer scientists there ever ...

Algebraic structures form the backbone of modern abstract algebra, encapsulating a wide range of systems such as groups, rings, fields, and modules, each characterised by distinct axiomatic properties ...

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 ...

Theoretical computer scientists are normally a fairly sedate bunch, but are humming with excitement after a potential breakthrough in a long-standing problem called graph isomorphism. The result could ...

A computer scientist has taken his colleagues on a rollercoaster ride. In the span of several days, László Babai of the University of Chicago walked back his earlier claim of making a major advance on ...

Let G be a finite 2-group of maximal nilpotency class, and let BG be its classifying space. We prove that iterated Massey products in H* (BG; 𝔽2) do characterize the homotopy type of BG among ...