A Problem Which Is Both And Is Said To Be Np Complete #792
A problem which is both _______ and _________ is said to be NP complete.
This multiple choice question (MCQ) is related to the book/course
gs gs101 Automata Theory.
It can also be found in
gs gs101 Intractable Problems - Non Deterministic Polynomial Time - Quiz No.1.
A problem which is both _______ and _________ is said to be NP complete.
NP, P
NP, NP hard
P, P complete
None of the mentioned
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
