The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
276 views
asked in Algorithms by (121 points) | 276 views

2 Answers

+4 votes
Best answer

You would need to know some examples (not all) of NP Complete problems and why they are NP Complete. For example 3SAT problem is NPC and in GATE they have asked about 2SAT. So, just learning some examples won't be enough.

answered by Veteran (348k points)
selected by
+2 votes
Yes you need to study P, NP computational problems
answered by Active (2.5k points)


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

36,187 questions
43,631 answers
124,059 comments
42,906 users