Publisher
Springer International Publishing
Reference12 articles.
1. Alon, N., Boppana, R.: The monotone circuit complexity of Boolean functions. Combinatorica 7(1), 1–22 (1987)
2. Andreev, A.E.: On a method for obtaining lower bounds for the complexity of individual monotone functions. Sov. Math. Dokl. 31, 530–534 (1985)
3. Crama, Y., Hammer, P.L. (eds.): Boolean functions: theory, algorithms, and applications. In: Encyclopedia of Mathematics and Its Applications, vol. 142. Cambridge University Pess, Cambridge (2011)
4. Graham, R.L., Sloane, N.J.A.: Lower bounds for constant weight codes. IEEE Trans. Inform. Theory 26(1), 37–43 (1980)
5. Jukna, S.: Tropical complexity, Sidon sets and dynamic programming. SIAM J. Discrete Math. 30(4), 2064–2085 (2016)