Abstract
For any n is an element of N and d = o (log log n), we prove that there is a Boolean function F on n bits and a value gamma = 2(-Theta(d)) such that F......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
