IN COMPUER SCIENCE IS NP=P OR NOT EQUAL AND UR REASON
a person who answer first I will consider it as brainliest answer
Answers
Answered by
1
There's no denying the fact that it's the most popular question in Computer Science :) which is still students and programmers wanna known with eager, yet a bit uncleared among CS students.
< NP = P >
firstly what's NP and P?
Here NP stands for non-deterministic Polynomial Time while,
P stands for Polynomial Time
That concept works on the imaginary computational model of computer literally known as TURNING MACHINE ( concern with several transitions )
In short, P is the subset of NP.
A condition 'X' is NP, now if
1. 'X' is in P
2. an algorithm which solves 'X' can be used to solve any 'X' any condition in 'X' ' in NP.
In simple each condition X' is reducible to X.
Here X must be Polynomial time computable and have a Polynomial size, in the size of X.
Computing an NP problem in Polynomial time gonna provide you with a Polynomial time solutions to all NP conditions.
< NP = P >
firstly what's NP and P?
Here NP stands for non-deterministic Polynomial Time while,
P stands for Polynomial Time
That concept works on the imaginary computational model of computer literally known as TURNING MACHINE ( concern with several transitions )
In short, P is the subset of NP.
A condition 'X' is NP, now if
1. 'X' is in P
2. an algorithm which solves 'X' can be used to solve any 'X' any condition in 'X' ' in NP.
In simple each condition X' is reducible to X.
Here X must be Polynomial time computable and have a Polynomial size, in the size of X.
Computing an NP problem in Polynomial time gonna provide you with a Polynomial time solutions to all NP conditions.
Similar questions