home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #16 / NN_1992_16.iso / spool / comp / theory / 1713 < prev    next >
Encoding:
Internet Message Format  |  1992-07-30  |  1.0 KB
  1. Xref: sparky comp.theory:1713 sci.math:9690
  2. Newsgroups: comp.theory,sci.math
  3. Path: sparky!uunet!cis.ohio-state.edu!pacific.mps.ohio-state.edu!zaphod.mps.ohio-state.edu!usc!rpi!batcomputer!munnari.oz.au!bruce.cs.monash.edu.au!monu6!fawlty8.eng.monash.edu.au!serdar
  4. From: serdar@fawlty8.eng.monash.edu.au (Serdar Boztas)
  5. Subject: List of NP-Complete Problems 
  6. Message-ID: <serdar.712471893@fawlty8.eng.monash.edu.au>
  7. Sender: news@monu6.cc.monash.edu.au (Usenet system)
  8. Organization: Monash University, Melb., Australia.
  9. Date: Thu, 30 Jul 1992 04:51:33 GMT
  10. Lines: 10
  11.  
  12. I know about the Garey & Johnson list at the end of their book 'Computers
  13. and Intractability'. Does anyone know of an updated list of problems
  14. known to be NP-Complete?
  15.  
  16. Serdar
  17. -- 
  18. Inhabited by absurd fears,  they only discuss  the puerilities with which 
  19. every fool is familiar, and dare not, by turning a bold hand to the human 
  20. heart, offer its gigantic idiosyncrasies to our views.     Sade, 'Justine'
  21. Serdar Boztas \\ serdar@fawlty1.eng.monash.edu.au \\ +(61)3-565-5722 
  22.