MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
State true or false?
Statement: If a problem X ..
1.
State true or false?
Statement: If a problem X is in NP and a polynomial time algorithm for X could also be used to solve problem Y in polynomial time, then Y is also in NP.
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following are not in NP?
Which of the following can be used to define NP complexity class?
In terms of NTIME, NP problems are the set of decision problems which can be solved using a non deterministic machine in _______ time.
Which of the following is incorrect for the given phrase<br>Phrase : solvable by non deterministic algorithms in polynomial time
State true or false?<br>Statement: If a problem X is in NP and a polynomial time algorithm for X could also be used to solve problem Y in polynomial time, then Y is also in NP.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply