The computational manipulation of polynomials is a foundational element across pure and applied mathematics, computer algebra, cryptography and scientific computing. Central tasks include ...

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

Professor Ross D King and his team have demonstrated for the first time the feasibility of engineering a nondeterministic universal Turing machine (NUTM), and their research is to be published in the ...

Quantum computers have the potential to speed up computation, help design new medicines, break codes, and discover exotic new materials—but that’s only when they are truly functional. One key thing ...

You scrambled up a Rubik’s cube, and now you want to put it back in order. What sequence of moves should you make? Surprise: You can answer this question with modern algebra. You might remember ...