home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #27 / NN_1992_27.iso / spool / sci / crypt / 4931 < prev    next >
Encoding:
Internet Message Format  |  1992-11-17  |  1.2 KB
  1. Xref: sparky sci.crypt:4931 sci.math:15118 comp.theory:2449
  2. Path: sparky!uunet!charon.amdahl.com!pacbell.com!sgiblab!darwin.sura.net!europa.asd.contel.com!emory!ogicse!das-news.harvard.edu!cantaloupe.srv.cs.cmu.edu!GS35.SP.CS.CMU.EDU!sgall
  3. From: sgall+@CS.CMU.EDU (Jiri Sgall)
  4. Newsgroups: sci.crypt,sci.math,comp.theory
  5. Subject: Re: Cryptography and P=NP
  6. Message-ID: <BxvEF3.Kqw.2@cs.cmu.edu>
  7. Date: 17 Nov 92 17:11:25 GMT
  8. Article-I.D.: cs.BxvEF3.Kqw.2
  9. References: <1992Nov15.110945.19939@ringer.cs.utsa.edu> <PHR.92Nov15203840@napa.telebit.com> <1e7fvdINN87s@iskut.ucs.ubc.ca> <1992Nov16.084503.10141@vax.oxford.ac.uk>
  10. Sender: news@cs.cmu.edu (Usenet News System)
  11. Distribution: inet
  12. Organization: Carnegie Mellon University
  13. Lines: 14
  14. Nntp-Posting-Host: gs35.sp.cs.cmu.edu
  15.  
  16. |> And remember, proving P=NP doesn't necessarily mean finding such an algorithm,
  17. |> merely proving it exists.
  18. |> 
  19.  
  20. Once you have the proof, you can easily run a kind of universal algorithm,
  21. which will be guaranteed to be polynomial
  22.  
  23. |> -- 
  24. |> James Annan.
  25. |>                 [--------------------------------------]
  26. |>                 [  "The only good Tory is a lavatory"  ]
  27. |>                 [--------------------------------------]
  28.  
  29. -- Jiri Sgall
  30.