Please turn JavaScript on
computationalcomplexity icon

computationalcomplexity

Subscribe to Computationalcomplexity’s news feed.

Click on “Follow” and decide if you want to get news from Computationalcomplexity via RSS, as email newsletter, via mobile or on your personal news page.

Subscription to Computationalcomplexity comes without risk as you can unsubscribe instantly at any time.

You can also filter the feed to your needs via topics and keywords so that you only receive the news from Computationalcomplexity which you are really interested in. Click on the blue “Filter” button below to get started.

Title: Computationalcomplexity

Is this your feed? Claim it!

Publisher:  Unclaimed!
Message frequency:  0.28 / day

Message History

Back in the 90s when I was a young professor at the University of Chicago, we would have a Complexity Class of the Week where I would take some interesting complexity class, write down on a white board everything we knew about it with some open problems and students and faculty would muse over it. When I started the blog in 2002, I took the


Read full story
Nutan Limaye and Thore Husfeldt guest post on the new deterministic parallel algorithm for bipartite perfect matching by Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj and Thomas Thierauf.
The post will try to explain three main things about the result. ...

Read full story

The excellent graphic novel

Prime Suspects: The Anatomy of Integers and Permutations

by Andrew Granville and Jennifer Granville,  illustrated by Robert J Lewis,

(I wrote a review of this graphic novel, for SIGACT News, here


Read full story

Two editorials in the July issue of the Communications of the Association for Computing Machinery ask about the decay and future of the organization itself.

Jim Larus, editor-in-chief of the CACM, writes 


Read full story