home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #26 / NN_1992_26.iso / spool / comp / theory / 2383 < prev    next >
Encoding:
Text File  |  1992-11-09  |  776 b   |  26 lines
  1. Newsgroups: comp.theory
  2. Path: sparky!uunet!stanford.edu!CSD-NewsHost.Stanford.EDU!Xenon.Stanford.EDU!kavraki
  3. From: kolount@cauchy.stanford.edu (Mihail N Kolountzakis)
  4. Subject: Is the following problem in NP?
  5. Message-ID: <1992Nov10.084511.27971@CSD-NewsHost.Stanford.EDU>
  6. Originator: kavraki@Xenon.Stanford.EDU
  7. Keywords: NP, polynomials, equations, solvability
  8. Sender: news@CSD-NewsHost.Stanford.EDU
  9. Organization: CS Department, Stanford University, California, USA
  10. Date: Tue, 10 Nov 1992 08:45:11 GMT
  11. Lines: 13
  12.  
  13.  
  14. INPUT: a polynomial F(x_1, ... , x_N) of bounded degree (say 10)
  15. and integer coefficients (also bounded by say 100).
  16.  
  17. OUTPUT: YES iff there are _real_ numbers x_1, ... , x_N that satisfy F=0.
  18.  
  19. Please reply to "kolount@cauchy.stanford.edu".
  20.  
  21. Mike Kolountzakis
  22.  
  23.  
  24.  
  25.  
  26.