Problems that can be solved in polynomial time are known as?

Related MCQs

•                    is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
• A non-deterministic algorithm is said to be non-deterministic polynomial if the time- efficiency of its verification stage is polynomial.
• Which of the following problems can’t be solved using recursion?
• Which of the following problems can be solved using the longest subsequence problem?
• Which of the following problems is NOT solved using dynamic programming?
• Which of the following problems should be solved using dynamic programming?
• Problems that cannot be solved by any algorithm are called?
• In what time can the Hamiltonian path problem can be solved using dynamic programming?
• The worst-case efficiency of solving a problem in polynomial time is?
• Fractional knapsack problem can be solved in time O(n).