P ?=? NP, attempt number 117

Professor Norbert Blum of University of Bonn has published a paper seeking to show P != NP: A Solution of the P versus NP Problem

I have no ability to critique the paper, though I did skim through parts of it. Complexity theory has progressed tremendously since I studied it as an undergraduate in the early 1980's.

But here are a few links, for those who are interested:

• The P-versus-NP page
• On Norbert Blum’s claimed proof that P does not equal NP
• On the Edge of Eclipses and P=NP
• StackExchange discussion page
• user 'vloodin's comment
• The Gap Between Monotone and NonMonotone Circuit Complexity is Exponential