Monthly Archives: November 2015

A Roll In The Hay

Haystacks.  Haystacks, everywhere. Let’s get something straight, all algorithms are exhaustive search.  We just need to find the right haystack. In a previous post I talked about complexity theory getting off to a bizarre, albeit beautiful, start that ended us … Continue reading

Posted in Intermediate, Landscape, TCS | Tagged , , , , | Leave a comment

Cold Off The Press!

Big news!  It looks like Laci Babai has a quasipolynomial time algorithm for Graph Isomorphism (GI). That is, GI has jumped from the best known algorithm being almost exponential, to being almost polynomial! But, of course, you probably already heard … Continue reading

Posted in Beginner, Community, Landscape, News, TCS | Tagged , , | Leave a comment

Alphabet Soup

Computational complexity theory is math putting us mere mortals in our place. Complexity theory got off to a bizarre, albeit beautiful, start.  Birthing from Hilbert’s majestic notion that, for mathematics, there is no ignorabimus, the race was on. The race … Continue reading

Posted in Beginner, Humanity, Landscape, TCS | Tagged , , | Leave a comment