P Vs .Np? Explain me the problem in computer science.

Question

I don't know what the problem is so please explain me the problem and also recommend me some topics related this question in computer science.If you don't know the answer then please upvote and share this question.

Answer 1

Look into complexity theory. Learning Big-O will help you understand the problem.

The P stands for Polynomial, and is related to polynomials in mathematics. Basically if a problem can be solved in P time, then the problem can be solved in the time specified by solving the polynomial expression. A problem that is in the class P is said to be solvable in a "reasonable" amount of time. Note that the time is usually an approximation, and is used to give an idea of how well an algorithm scales (hence Big-O).

The NP is non-deterministic polynomial. These problems are said to be "difficult" problems (generally large combinations needed to be assessed to solve). These problems are resource intensive and can be quickly out of range of even the best computers to solve.

The question of whether P=NP. Is a question of sets. All problems in P time can be solved in NP time, but what is being asked is, whether all problems in NP time can be solved in P time.

Use Google to find problems/algorithms in these classes.

Answer 2

https://wikipedia.org/wiki/P_versus_NP_problem
My recommendation is:
Don't wate your time in this <thing

Answer 3

Ayushman I'm not sure if your link is completely relevant to this thread.

Answer 4

https://en.wikipedia.org/wiki/Complexity_class

p is a subset of np where concepts in p rely on concepts in np type problems.

P is the class of problems that are solvable by a deterministic Turing machine in polynomial time and NP is the class of problems that are solvable by a nondeterministic Turing machine in polynomial time.

Answer 5

Usman Muhammed Do NOT advertise your codes on random threads.