NP Problems

I am sure most of the computer science students must aware of these

Problems that are also known as Non Polynomial Problems .

Such Problems are those which can not be executed in Polynomial time

infact run time of these problems varies exponentially.Till now researchers

are

continuously working on these problems but they are not successful in solving

these Problems for eg Hamiltonian cycle ,Vertex cover all these problem are

NP or NP hard Problems ?

I want to know about view points about these problems?What you say

about these problems

Replies

You are reading an archived discussion.

Related Posts

I am a 2nd year student of Metallurgy and material science engineering in NIT Jamshedpur.I am looking for summer training in IITs or in NITs this year.Please help me informing...
Following is the list of top 25 questions asked last year in Google & Microsoft Interview; published by Glassdoor: Let's try to answer them 😉 What was your best McGuyver...
Hello mates, I have cell phone charger and Laptop charger which I got from India and its specs are like some 220 v 50Hz, with 3 round shaped pins. Now...
Hello Guys, I am actually interested to work with Microwaves Engineering and I wonder what kind of jobs or job titles would be available in USA, in India or in...
Inspired by CE badge, I tried to create the badge of my blog. For that I added an image in my blog itself and created a web link for image....