Discussion Board
Go to the previous messageThere are no next messages
Current Forum: 15-211 Main Forum
Date: Tue Dec 18 2001 7:09 pm
Author: Maxim, Michael G. <mmaxim@andrew.cmu.edu>
Subject: Re: NP problems....
We suspect it looks like that, but take notice that if we discover (highly unlikely) a polynomial-time algorithm for an NP-complete problem, then the whole blob will just be labelled P! This is what people refer to when they say, does P=NP?

Mike
Post response
Go to the previous messageThere are no next messages
Current Thread Detail:
NP problems....      White, David      Mon Dec 17 2001 3:37 pm       
Re: NP problems....      Scherlis, William L.      Mon Dec 17 2001 4:12 pm       
Re: NP problems....      Shi, Ying      Mon Dec 17 2001 4:26 pm       
Re: NP problems....      Lee, Charles C.      Mon Dec 17 2001 7:44 pm       
Re: NP problems....      Maxim, Michael G.      Mon Dec 17 2001 8:00 pm       
Re: NP problems....      White, David      Mon Dec 17 2001 8:42 pm       
Re: NP problems....      Maxim, Michael G.      Tue Dec 18 2001 1:38 pm       
Re: NP problems....      White, David      Tue Dec 18 2001 3:34 pm       
Re: NP problems....      Maxim, Michael G.      Tue Dec 18 2001 7:09 pm       
Back to previous screen