Hard computation. How hard is it to compute nl-n(n-1)(n-2)... (2)(1)? Do you think there is a polynomial-time algorithm for computing n!? Why or why not? Think about the number of stepa needed to carry out that many multiplications. For example, would you want to find 100! by hand?

Question

Hard computation. Question in the attached image

4. Hard computation. How hard is it to compute nl-n(n-1)(n-2)... (2)(1)? Do you think there is a
polynomial-time algorithm for computing n!? Why or why not? Think about the number of steps
needed to carry out that many multiplications. For example, would you want to find 100! by hand?
Transcribed Image Text:4. Hard computation. How hard is it to compute nl-n(n-1)(n-2)... (2)(1)? Do you think there is a polynomial-time algorithm for computing n!? Why or why not? Think about the number of steps needed to carry out that many multiplications. For example, would you want to find 100! by hand?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps

Blurred answer