G. Ramalingam
Theoretical Computer Science
We construct formulae that assume the value 1 when and only when at least k of their n variables assume the value 1, using only conjunction and disconjunction, and having (for any fixed k) only O(nlogn) k 2log*n occurences of variables. © 1978.
G. Ramalingam
Theoretical Computer Science
Thomas M. Cover
IEEE Trans. Inf. Theory
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007