You can try to reduce a classic NPC problem to the target problem. If this can be done, you can surely say the target problem is a NPC problem.
On 8/29/10, mohit verma <mohit89m...@gmail.com> wrote: > hi all, > can anyone tell me how can one recognize a given problem whether it is NP > complete or incomplete or N complete in some considerable time limit. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Sent from my mobile device -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
