Article View: comp.theory
Article #1895Re: P=NP; the proof
From: Mike Robson
Date: Wed, 06 Jan 1993 19:42
Date: Wed, 06 Jan 1993 19:42
20 lines
1287 bytes
1287 bytes
jmr@cs.anu.edu.au (Mike Robson) writes: >Who can shoot down this alleged proof that P=NP? >The ideas are taken from the Gismondi and Swart papers but the >algorithms are simplified and the proofs are completely new. >If you haven't read their papers, you will probably not follow this. >I'll post a more detailed version soon unless anyone has convinced >me I'm wrong (in which case I will post a retraction). I was wrong about the dimensions of the matrix M since it has more rows than the number of nonzero sab. I can't see any way to fix this (though I am working on it). I've had mail from Peter Breuer of Cambridge who says he has found a fix. I am looking forward to hearing from him what it is. So currently my proof is dead but if you believe in resurrection watch this space. Mike Robson.
Technical Details
Message-ID:
<1ifcmpINN11k@nunki.anu.edu.au>Path:
arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!csis!dubhe.anu.edu.au!nunki.anu.edu.au!not-for-mailReferences:
<1idr1nINNrl@nunki.anu.edu.au>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!csis!dubhe.anu.edu.au!nunki.anu.edu.au!not-for-mail From: jmr@cs.anu.edu.au (Mike Robson) Newsgroups: comp.theory Subject: Re: P=NP; the proof Date: 7 Jan 1993 06:42:17 +1100 Organization: Computer Science Department, ANU, Australia Lines: 21 Distribution: inet Message-ID: <1ifcmpINN11k@nunki.anu.edu.au> References: <1idr1nINNrl@nunki.anu.edu.au> NNTP-Posting-Host: nunki.anu.edu.au Keywords: Collapse of hierarchy