학교 공부 썸네일형 리스트형 Solution for Exercise 1.18 Exercise 1.18 ) We have a function F : {0,...,n − 1} → {0,...,m − 1}. We know that , for 0 ≤ x, y ≤ n−1, F((x+y) mod n)=(F(x)+F(y)) mod m. The only way we have for evaluating F is to use a lookup table that stores the values of F. Unfortunately, an Evil Adversary has changed the value of 1/5 of the table entries when we were not looking. Describe a simple randomized algorithm that, given an inpu.. 더보기 Probability and Computing 2nd edition pdf by Cambridge university express 더보기 이전 1 2 3 4 5 다음
