home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!uknet!edcastle!dcs.ed.ac.uk!pdc
- From: pdc@dcs.ed.ac.uk (Paul Crowley)
- Newsgroups: sci.crypt
- Subject: Re: Something about cryptology
- Message-ID: <C17CqM.7Dr@dcs.ed.ac.uk>
- Date: 21 Jan 93 11:47:09 GMT
- References: <1993Jan15.085414.3196@netcom.com> <1993Jan19.222030.16193@netcom.com>
- Sender: cnews@dcs.ed.ac.uk (UseNet News Admin)
- Reply-To: pdc@dcs.ed.ac.uk (Paul Crowley)
- Organization: Edinburgh University
- Lines: 13
-
- Quoting cliftonr@netcom.com (Pope Clifton) in article <1993Jan19.222030.16193@netcom.com>:
- >
- >moreover, there is no sign of
- >any improvements on the horizon, and there seem to be essentially no
- >mathematicians or computer scientists who believe that P = NP.
-
- Not quite; there was a debate on the subject in comp.theory, and many
- of those posting were far from certain that P!=NP. One lot are even
- working towards an O(n^6) algorithm for the Subset Sum problem using
- linear programming, based on the Gismondi and Swart paper "N=1".
- __ _____
- \/ o\ Paul Crowley pdc@dcs.ed.ac.uk \\ //
- /\__/ Trust me. I know what I'm doing. \X/
-