in Others closed by
347 views
0 votes
0 votes
closed with the note: Solved via comment
I want to know whether the problems on NP, P, NP-Hard, NP-complete are completely out of Gate 2016 syllabus?
in Others closed by
347 views

1 comment

Shouldn't really matter- once you study decidability for TOC, this area is already covered. Meanwhile problems using known NPC problems wouldn't be there.
1
1

Related questions

4 votes
4 votes
1 answer
1
0 votes
0 votes
0 answers
2
Kathleen asked in Others Oct 8, 2014
319 views
Kathleen asked in Others Oct 8, 2014
319 views
0 votes
0 votes
0 answers
3
Kathleen asked in Others Oct 8, 2014
417 views
Kathleen asked in Others Oct 8, 2014
417 views
2 votes
2 votes
0 answers
4
Kathleen asked in Others Oct 8, 2014
1,096 views
Kathleen asked in Others Oct 8, 2014
1.1k views
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