3 ms·
This reminds of an undergrad paper I once wrote in which I showed that binary functions in n variables need asymptotically not more (and seldom less) than 2^n/n
by whiterock 3y ago
This reminds of an undergrad paper I once wrote in which I showed that binary functions in n variables need asymptotically not more (and seldom less) than 2^n/n boolean gates.
- throw345d605c 3y agoIs this published anywhere?