Which of the following is a P-complete type of problem? – McqOptions

MCQOPTIONS

1.	Which of the following is a P-complete type of problem?
A.	Circuit Value problem
B.	Linear programming
C.	Context free grammar membership
D.	All of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

State true or false?<br>Statement: Given a turing machine, an input for the machine, and a number T(unary), does that machine halt on that input within the first T-steps?
Which of the following is a P-complete type of problem?
A problem X belongs to P complexity class if there exist ________ algorithm to solve that problem, such that the number of steps of the algorithms bounded by a polynomial in n, where n is the length of the input.
The complexity class P consist of all the decision problems that can be solved by ___________using polynomial amount of computation time.
If the number of steps required to solve a problem is O(n<sup>k</sup>), then the problem is said to be solved in: