Tag Archives: P vs NP

Meanwhile Over In Computer Science

Posted on November 16, 2015 by annahaensch

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 , , , , , , , | 2 Comments