Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
self doubt (complexity classes)
BASANT KUMAR
asked
in
Algorithms
Sep 1, 2018
retagged
Jun 13, 2022
by
makhdoom ghaya
163
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.
p-np-npc-nph
BASANT KUMAR
asked
in
Algorithms
Sep 1, 2018
retagged
Jun 13, 2022
by
makhdoom ghaya
by
BASANT KUMAR
163
views
answer
comment
Follow
share this
share
1 comment
by
Deepanshu
commented
Sep 2, 2018
reply
Follow
share this
I THINK NP AND NPHARD IS NOT IN THE SYLLABUS OF GATE.......
IF IT IS SELF DOUBT THEN I DONT KNOW ABOUT THEM :)
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
vijju532
asked
in
Algorithms
Jul 2, 2018
224
views
self doubt
all NP problems have the complexity exponential ???
vijju532
asked
in
Algorithms
Jul 2, 2018
by
vijju532
224
views
algorithms
p-np-npc-nph
time-complexity
2
votes
2
votes
0
answers
2
ankit_thawal
asked
in
Algorithms
Jan 14, 2018
266
views
Self Doubt IMP
Can Anyone please post the diagram which describes the relation between P, NP, NPSPACE, NP-Hard, EXPONENTIAL TIME etc.
ankit_thawal
asked
in
Algorithms
Jan 14, 2018
by
ankit_thawal
266
views
p-np-npc-nph
1
vote
1
vote
1
answer
3
rude
asked
in
Algorithms
May 23, 2016
2,590
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 reduced further. but What I have seen here that in ... techniques? Put some light, Am I missing something. Should I stop seeing those notes which people have posted over the internet.
rude
asked
in
Algorithms
May 23, 2016
by
rude
2.6k
views
time-complexity
dynamic-programming
p-np-npc-nph
0
votes
0
votes
0
answers
4
srestha
asked
in
Theory of Computation
Apr 22, 2019
905
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?
srestha
asked
in
Theory of Computation
Apr 22, 2019
by
srestha
905
views
p-np-npc-nph
theory-of-computation
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
