a) O(n)
b) O(n1/2)
c) O(nk), k∈N
d) None of the mentioned
In terms of NTIME, NP problems are the set of decision problems which can be solved using a non deterministic machine in
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
In terms of NTIME, NP problems are the set of decision problems which can be solved using a non deterministic machine in
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!