Assume that you have a program that solves the second problem in time e(n"), for r > 1. use it to solve the first problem in polynomial time? if so, how, and how fast is your can you algorithm? 16. assume that you have a program that solves the first problem in time (n*), for s2 1. can you use it to solve the second problem in polynomial time? if so, how, and how fast is your algorithm?

Solved
Show answers

Ask an AI advisor a question