home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #27 / NN_1992_27.iso / spool / sci / crypt / 4854 < prev    next >
Encoding:
Internet Message Format  |  1992-11-15  |  858 b 
  1. Xref: sparky sci.crypt:4854 sci.math:15037 comp.theory:2433
  2. Path: sparky!uunet!zaphod.mps.ohio-state.edu!malgudi.oar.net!caen!spool.mu.edu!uwm.edu!psuvax1!rutgers!igor.rutgers.edu!remus.rutgers.edu!clong
  3. From: clong@remus.rutgers.edu (Chris Long)
  4. Newsgroups: sci.crypt,sci.math,comp.theory
  5. Subject: Re: Cryptography and P=NP
  6. Message-ID: <Nov.16.03.59.05.1992.2368@remus.rutgers.edu>
  7. Date: 16 Nov 92 08:59:05 GMT
  8. References: <1992Nov15.110945.19939@ringer.cs.utsa.edu>
  9. Followup-To: sci.crypt
  10. Organization: Rutgers Univ., New Brunswick, N.J.
  11. Lines: 10
  12.  
  13. In article <1992Nov15.110945.19939@ringer.cs.utsa.edu>, Daniel Jimenez writes:
  14.  
  15. >> This proves that P=NP and all NP-complete and all other NP problems thus
  16. >> have polynomial time algorithms.
  17.  
  18. Anyone who believes P=NP is an idiot.
  19.  
  20. Case closed.
  21. -- 
  22. Chris Long, 265 Old York Rd., Bridgewater, NJ  08807-2618
  23.