Register

self doubt (complexity classes)

• retagged by
355 views
0 0 votes
why PSpace is more complex to P and NP problem is it same as NP hard problem or NPC problem??can anyone explain it with example.

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · sql queryNext → · Testbook Test Series...
← Previous in category · SELF DOUBTNext in category → · Time complexity
Position:
Show:

Related questions

0 0 votes
1 1 answer
550
550 views
vijju532 asked Jul 2, 2018
550 views
self doubt
all NP problems have the complexity exponential ???
2 2 votes
0 0 answers
578
578 views
ankit_thawal asked Jan 14, 2018
578 views
Self Doubt IMP
Can Anyone please post the diagram which describes the relation between P, NP, NPSPACE, NP-Hard, EXPONENTIAL TIME etc.
1 1 vote
1 answers 1 answer
3.6k
3.6k views
rude asked May 23, 2016
3,559 views
What is the time complexity of Binary Knapsack?
I was reading some of the notes (made easy and ACE) and noticed that some teacher have taught that time complexity for Binary Knapsack O(2^(n/2)). which can not be reduc...
0 0 votes
0 0 answers
2.2k
2.2k views
srestha asked Apr 22, 2019
2,228 views
Self-Doubt(P-NP class)
$1)$ If the complement of NP-Complete problem is in NP, then can we also say , for this case complement of NP problem is in NP-Complete ?$2)$ If the complement of NP-Comp...