lecture
... Find smallest number of coins that sum to X Solution: C[n] = smallest number of coins required for amount n What is the base case? What is the recursive case? ...
... Find smallest number of coins that sum to X Solution: C[n] = smallest number of coins required for amount n What is the base case? What is the recursive case? ...
Arithmetic Circuits and Identity Testing
... ideas from computer science, we call any polynomial that can be computed using at most n O(1) operations an easy polynomial. Strictly speaking, this definition applied to an infinite family of polynomials over n variables, one for each n, as otherwise every polynomial can be computed using O(1) oper ...
... ideas from computer science, we call any polynomial that can be computed using at most n O(1) operations an easy polynomial. Strictly speaking, this definition applied to an infinite family of polynomials over n variables, one for each n, as otherwise every polynomial can be computed using O(1) oper ...
