MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
Complement of all the problems in PSPACE is ______...
1.
Complement of all the problems in PSPACE is ________
A.
PSPACE
B.
NL
C.
P
D.
All of the mentioned
Answer» B. NL
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Complement of all the problems in PSPACE is ________
Without needing extra __________ we can simulate non deterministic turing machine using deterministic turing machine.
Statement : All PSPACE problems can be reduced to PSPACE-complete problems.State true or false:
NL PSPACE EXPSPACEThe given relation involves which of the following theorems?
Correct the given order:NL P NP PH PSPACE
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
