home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!munnari.oz.au!manuel.anu.edu.au!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 09:14:17 +1100
- Organization: Computer Science Department, ANU, Australia
- Lines: 31
- Distribution: inet
- Message-ID: <1ifljqINN137@nunki.anu.edu.au>
- References: <1idr1nINNrl@nunki.anu.edu.au> <1ifcmpINN11k@nunki.anu.edu.au>
- NNTP-Posting-Host: nunki.anu.edu.au
- Keywords: Collapse of hierarchy
-
- jmr@cs.anu.edu.au (Mike Robson) writes:
-
- >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.
-
- AARRGGHH!!
-
- Jim Reeds has proved that this problem cannot be fixed.
- I'll go back to trying to decide if the current Gismondi and Swart
- linear programming formulation has the required property (that every
- solution covers a permutation). If that claim is true, then I think
- my approach is a good way to try and prove it.
-
-