adplus-dvertising
frame-decoration

Question

The value of constants like p and e can be calculated in:

a.

polynomial time

b.

non-polynomial time

c.

cannot be calculated

d.

none of the mentioned

Answer: (a).polynomial time

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The value of constants like p and e can be calculated in:

Similar Questions

Discover Related MCQs

Q. Which of the following cannot be solved using polynomial time?

Q. The complexity class P consist of all the decision problems that can be solved by ___________using polynomial amount of computation time.

Q. A generalization of P class can be:

Q. Which of the following options are correct with reference to P-complete problems?

Q. 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.

Q. Which of the following is a P-complete type of problem?

Q. State true or false?
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?

The given problem is P-complete.

Q. What does NP stands for in complexity classes theory?

Q. The hardest of NP problems can be:

Q. Which of the following contains NP?

Q. Travelling sales man problem belongs to which of the class?

Q. State true or false?
Statement: If a problem X is in NP and a polynomial time algorithm for X could also be used to solve problem Y in polynomial time, then Y is also in NP.

Q. A problem which is both _______ and _________ is said to be NP complete.

Q. Which of the following is incorrect for the given phrase:

'solvable by non deterministic algorithms in polynomial time'

Q. In terms of NTIME, NP problems are the set of decision problems which can be solved using a non deterministic machine in _______ time.

Q. Which of the following can be used to define NP complexity class?

Q. Which of the following are not in NP?

Q. Which of the following does not belong to the closure properties of NP class?

Q. Which of the given problems are NP-complete?

Q. Which of the following problems do not belong to Karp’s 21 NP-complete problems?