Posted By Vijay

A good idea santosh, we can discuss on any interesting topic like you mentioned
.NET , oop, windows, XML , webservices , mathematics , physics etc ...etc. (anything and everything )
All of us can surely gain some knowledge from others .
what do you say , sina , sada , Lakshmi, sriram and others ?
but I am sure , the one who is always going to give is Santosh :-)
and we are all but listeners (most of the time at least ). :-) (Right ?)
Well, the above prologue was to indicate that santosh should excuse any of us (especially me)
if there is some wrong information put forth and correct any of us anytime.
Here is one topic that I became interested lately.
not sure if anybody of you will really like it.
Its about Non-Deterministic Polynomial (NP) and NP-hard problems.
well actually I was never really good at mathematics, and I still think that I am not.
what I am getting at is , I am not trying to solve NP / NP hard problems , but trying to understand as to how to qualify or recognize
a problem as NP/NP hard.
After much reading , I understood that I need to have some basic understanding of Discrete Mathematics.
I know that we studied it in college , and I also got the proof that I had not studied well :-)
--------------------------------------------------------------
so here goes , anybody on the basics ?
can anybody tell me about NP problems.
Please don't give any stereotype , text book definitions because I have read them all
give me some basic examples and analysis on them.
any help will do :-)
just put a blog on this, we all can continue.
---------------------------------------------------------------------------------