The depth of the circuit needed to compute the final sum of two numbers is logarithmic in their bitlengths,
but if we are only interested in ⌊s1 + s2⌉ mod 2 and have the promise that s1+s2 is within
1/4 of an integer, this value can be computed by multivariate polynomial of degree 4 (and only nine
terms),陈老师,这句话是怎么理解的啊?
陈老师,你好,在基于整数的全同态的那篇文章中
The depth of the circuit needed to compute the final sum of two numbers is logarithmic in their bitlengths,
but if we are only interested in ⌊s1 + s2⌉ mod 2 and have the promise that s1+s2 is within
1/4 of an integer, this value can be computed by multivariate polynomial of degree 4 (and only nine
terms).后半句this value can be computed by multivariate polynomial of degree 4 (and only nine
terms).这句话是怎么理解的啊?求解释!