Article View: sci.crypt
Article #1759Re: Cryptography and P=NP
From: Chris Long
Date: Mon, 16 Nov 1992 08:59
Date: Mon, 16 Nov 1992 08:59
10 lines
819 bytes
819 bytes
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. Case closed. -- Chris Long, 265 Old York Rd., Bridgewater, NJ 08807-2618
Technical Details
Message-ID:
<Nov.16.03.59.05.1992.2368@remus.rutgers.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!malgudi.oar.net!caen!spool.mu.edu!uwm.edu!psuvax1!rutgers!igor.rutgers.edu!remus.rutgers.edu!clongReferences:
<1992Nov15.110945.19939@ringer.cs.utsa.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!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 From: clong@remus.rutgers.edu (Chris Long) Newsgroups: sci.crypt,sci.math,comp.theory Subject: Re: Cryptography and P=NP Message-ID: <Nov.16.03.59.05.1992.2368@remus.rutgers.edu> Date: 16 Nov 92 08:59:05 GMT References: <1992Nov15.110945.19939@ringer.cs.utsa.edu> Followup-To: sci.crypt Organization: Rutgers Univ., New Brunswick, N.J. Lines: 10