Opinions expressed on these pages were the views of the writers and did not necessarily reflect the views and opinions of the American Mathematical Society.
Tag Archives: Scott Aaronson
Meanwhile Over In Computer Science
An algorithm has just been proposed for solving the graph isomorphism problem in quasipolynomial time, dealing a serious blow to hard problems all over the world. But let me first explain what all of those words mean. Graphs, you’ll recall, … Continue reading
Posted in Events, Mathematics and Computing Tagged complexity theory, Gabriel Gaster, graph theory, Jeremy Kun, Laszlo Babai, Luca Trevisan, P vs NP, Scott Aaronson 2 Comments