Computer Science, asked by vishwaarnav27, 3 months ago

what is NP complete probelm

Answers

Answered by Anonymous

27

.In computational complexity theory, a problem is NP-complete when: A nondeterministic Turing machine can solve it in polynomial-time. A deterministic Turing machine can solve it in large time complexity classes and can verify its solutions in polynomial time

Answered by chandrakantakesh73

0

Answer:

mibinumk ubkbhuk

yvfgyyoyft

Explanation:

huvhbyvftigivuvihihouigugugyihi7hvffv7jununybrfih45ty

Previous Question

Next Question

Similar questions

English, 1 month ago

mohan purchesd sone carpet in 7250 and after some time sold those 6050 then find out lossrgin percentage of mohan...

Math, 1 month ago

Find the following product using appropriate identities (1) (x + 5) (x + 5) (ii) (p - 3) (p+3) (iii)(y- 1)(y-1) (iv) (t + 2) (t + 4) (v) 102 x 98 (vi) (x + 1)(x + 2)(x + 3)...

English, 1 month ago

there are no ghosts in this house identify the noun and classify them...

Math, 3 months ago

The number of members in the 20 families in Bhilar are as follows : 1 , 6 , 5 , 4 , 3 , 2 , 7 , 2 , 3 , 4 , 5 , 6 , 4 , 6 , 2 , 3 , 2 , 1 , 4 , 5 Prepare a frequency table and find the mean of members of 20 families ...

Math, 3 months ago

Mrs. Ainsworth purchased a 3.25-pound chicken for $4.52. Find the unit price. *...

History, 9 months ago

What is meaning of Jagger...

Chemistry, 9 months ago

Many tiny droplets high up in the air come together and fall down as...

Math, 9 months ago

The probability of getting the correct answer in a certain text question is x by 8 and the probability of not getting the correct answer is 3 by 4 find the probability...