Register

self doubt (complexity classes)

• retagged by
164 views
0 votes
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.
• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
vijju532 asked Jul 2, 2018
226 views
self doubt
all NP problems have the complexity exponential ???
all NP problems have the complexity exponential ???
User Avatar
2 votes
2 votes
0 answers
2
ankit_thawal asked Jan 14, 2018
273 views
Self Doubt IMP
Can Anyone please post the diagram which describes the relation between P, NP, NPSPACE, NP-Hard, EXPONENTIAL TIME etc.
Can Anyone please post the diagram which describes the relation between P, NP, NPSPACE, NP-Hard, EXPONENTIAL TIME etc.
User Avatar
0 votes
0 votes
0 answers
4
srestha asked Apr 22, 2019
900 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-Complete problem is in Co-NP, then can we also say, for this case complement of Co-NP problem is in NP-Complete?
$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...
User Avatar
Link Copied!