Article View: sci.crypt
Article #1775Re: Cryptography and P=NP
From: G.J. McCaughan
Date: Mon, 16 Nov 1992 18:15
Date: Mon, 16 Nov 1992 18:15
17 lines
1231 bytes
1231 bytes
In article <Nov.16.03.59.05.1992.2368@remus.rutgers.edu> clong@remus.rutgers.edu (Chris Long) writes: >In article <1992Nov15.110945.19939@ringer.cs.utsa.edu>, Daniel Jimenez writes: > >>> This proves that P=NP and all NP-complete and all other NP problems thus >>> have polynomial time algorithms. > >Anyone who believes P=NP is an idiot. Like Bela Bollobas, then. Right. This sort of idiocy I could live with. On what basis do you make this assertion? (Incidentally, I guess P!=NP, but without knowing enough about complexity theory to make assertions like the above one.) -- Gareth McCaughan Dept. of Pure Mathematics & Mathematical Statistics, gjm11@cus.cam.ac.uk Cambridge University, England. [Research student]
Technical Details
Message-ID:
<1992Nov16.181517.5023@infodev.cam.ac.uk>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!pavo.csi.cam.ac.uk!gjm11References:
<1992Nov15.110945.19939@ringer.cs.utsa.edu> <Nov.16.03.59.05.1992.2368@remus.rutgers.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!pavo.csi.cam.ac.uk!gjm11 From: gjm11@cus.cam.ac.uk (G.J. McCaughan) Newsgroups: sci.crypt Subject: Re: Cryptography and P=NP Message-ID: <1992Nov16.181517.5023@infodev.cam.ac.uk> Date: 16 Nov 92 18:15:17 GMT References: <1992Nov15.110945.19939@ringer.cs.utsa.edu> <Nov.16.03.59.05.1992.2368@remus.rutgers.edu> Sender: news@infodev.cam.ac.uk (USENET news) Organization: U of Cambridge, England Lines: 17 Nntp-Posting-Host: apus.cus.cam.ac.uk