Register

P and NP

• retagged by
2,084 views

2 Answers

3 votes
3 votes
it is not in gate exam . but if u want to understand concept of decidability in toc more better then u should have some basic knowledge of it
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

439
views
1 answers
0 votes
Hradesh patel asked Nov 20, 2016
439 views
MadeEasy Test Series: Algorithms - P Np Npc Nph
Q. consider the following problem:a) Eulerian pathb) 2- SATc) Constraint reachibiltyd)graph coloringnumber of problem which is polynomial solvable?? i am get only b (2-SA...
User Avatar
2.3k
views
2 answers
0 votes
LavTheRawkstar asked Mar 26, 2017
2,320 views
having confusion in P ,Np,NP hard and Np completness
what i have tried to get out the conslusion for P problem is that P problemThese are set of those yes/no problems which can solved using polynomic time complexity algroi...
User Avatar
1.3k
views
1 answers
1 votes
Rhythm asked Apr 20, 2019
1,294 views
P and NP Question doubt
What will be the answer to this question? L’ is the complement of language L belongs to NP does not always imply thatL’ belongs to NPL’ belongs to P both a and b
User Avatar
578
views
0 answers
0 votes
hacker16 asked Dec 24, 2017
578 views
did P and NP is still in the syllabus? @ COMPUTABILITY AND COMPLEXITY{TOC}
did P and NP is still in the syllabus? @ COMPUTABILITY AND COMPLEXITY{TOC}
User Avatar
Link Copied!