Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!dory.cis.ohio-state.edu!sarrel From: sarrel@dory.cis.ohio-state.edu (Marc Sarrel) Newsgroups: comp.graphics Subject: Re: plotter optimizing algorithm Message-ID: Date: 25 Apr 89 05:12:46 GMT References: <633@jc3b21.UUCP> <863@mplvax.EDU> <2271@water.waterloo.edu> Sender: news@tut.cis.ohio-state.edu Organization: Ohio State Computer Science Lines: 17 In-reply-to: ymchee@water.waterloo.edu's message of 25 Apr 89 00:25:47 GMT In article <2271@water.waterloo.edu> ymchee@water.waterloo.edu (Yeow Meng Chee) writes: In article , sarrel@dory.cis.ohio-state.edu (Marc Sarrel) writes: > optimization problem. If the pen optimization problem is, therefore, > NP-Complete, it cannot be solved in non-deterministic polynomial time. > ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Of course the problem could be solve in non-deterministic polynomial time (independent of whether P=NP or not). That is what NP is all about. Sorry, my fault. Honest, I do know what NP-Complete is. Attribute the above mistake to a typo. :-) :-) -=- "Master, why is the letter 'i' the symbol for current?" "Because there is no letter 'i' in the word 'current'." "Master, why do we use the letter 'j' as sqrt(-1)?" "Because we use the letter 'i' for current." Whereupon the Master struck the Disciple, and the Disciple became enlightened.