NP-COMPLETENESS: Could it be a limitation?

Share This Post

Share on facebook
Share on linkedin
Share on twitter
Share on email

It is time for us to pay attention to non-deterministic polynomial time (NP-complete) problems. Non-deterministic polynomial time references non-deterministic Turing machines for problems and solutions dealing with decisions. It is still unknown if an NP-complete problem can be solved in polynomial time on a deterministic Turing machine.

More To Explore

Article

Interoperability and Scaling of Blockchain:

LokChain is the first blockchain platform that carefully solves majority of the problems (WIP) tormenting the use and integration of blockchain technology (refer to DLT).