Is NP Hard Problem Solvable in Polynomial Time

Posted by

Hello Friends, in this blog I will share my views on the topic i.e. Is NP Hard Problem Solvable in Polynomial Time.
I will share my views using simple to understand concepts and ideas which will enhance your overall knowledge.

So, let’s get started.

Friends, when we solve any computation problem we consider two things ie. Space and Time. No matter Today we don’t have technology to solve NP Hard problem in considerable time but I am very much optimistic that in future we can easily solve tough computations and be able to see result in a blink of an eye.

Thanks to quantum computation algorithms and advanced hyper-threading based hardware that we are heading into an era of technology revolution and singularity.

Now the big question is, will we be able to save humanity from collapse through these revolutionary ideas and the answer is quite ambiguous. There might be a chance that technology in the end would invade us and become uncontrollable if diligent efforts won’t be taken by all of us now. The good news is that our future generations will achieve something that was the realm of impossible for old human generations.

In future, I will throw more light on NP Hard problems and the scope to solve those ones in polynomial time. Even this topic falls under one of the category of Million dollar prize problem as laid by Clay Mathematics Foundation. Keep visiting my website to know more on exotic topics in varied fields of humanity and human wisdom.

Thank you for sparing some time in reading this blog post i.e. Is NP Hard Problem Solvable in Polynomial Time.
I hope the thoughts expressed in this post have provided you the information that you are searching for. Do not forget to comment on this blog as a token of your support towards my effort to spread knowledge to everyone on exotic topics. Also, don’t forget to Subscribe to this website.


Leave a Reply

Your email address will not be published. Required fields are marked *