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?
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?
Related questions
Question
Hard computation. Question in the attached image
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps