INFO4MYSTREY

This blog is created for educational purposes. Info4mystery archive and support student, teacher, Educationalists, Scholars and other people for learning by facilitating reflection, questioning by self and others, collaboration and by providing contexts for engaging in higher-order thinking.

Full width home advertisement

Popular Posts

Post Page Advertisement [Top]

P versus NP is defined in the Turing Machine:

Formally, the P is the class of problems that solved by a Deterministic Turing machine in polynomial a time. NP is the class of problems that were resolved by a non-deterministic Turing machine a polynomial time, which means that it can be solved by brute force algorithm in exponential time. We know that every P problem is also an NP one. In fact, the fast algorithm that solves P problems can be quickly authentication algorithm. The question is, can we find an NP problem which did not decide on a fast algorithm solve it. If so then NP is different from P. If no then NP is identical to P. 3


No comments:

Post a Comment

Labels

Bottom Ad [Post Page]

| Designed by Colorlib