home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #16 / NN_1992_16.iso / spool / comp / theory / 1685 < prev    next >
Encoding:
Internet Message Format  |  1992-07-24  |  498 b 

  1. Path: sparky!uunet!mcsun!uknet!harrier.ukc.ac.uk!eagle.ukc.ac.uk!jkp
  2. From: jkp@ukc.ac.uk (J.K.Pearson)
  3. Newsgroups: comp.theory
  4. Subject: Complexity of Integer Programming.
  5. Message-ID: <1371@eagle.ukc.ac.uk>
  6. Date: 24 Jul 92 13:47:17 GMT
  7. Sender: jkp@ukc.ac.uk
  8. Organization: Electronics Lab, University of Kent at Canterbury, UK.
  9. Lines: 8
  10.  
  11.  
  12. Can some body answear me a simple question, what is the complexity of integer
  13. programming, (I think it's NP complete but I'm not sure.)
  14.  
  15.  
  16. Thanks
  17.  
  18. Justin Pearson
  19.