Shao Chin Sung, Keisuke Tanaka, 2906, Algorithms and Computation, 2003, 108
Stasys Jukna, “Coin Flipping in Dynamic Programming Is Almost Useless”, ACM Trans. Comput. Theory, 12, № 3, 2020, 1
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma, 12273, Computing and Combinatorics, 2020, 566
V. Dičiūnas, “On the positive and the inversion complexity of Boolean functions”, RAIRO-Theor. Inf. Appl., 27, № 4, 1993, 283
Tso-Kai Liu, “Synthesis of Multilevel Feed-Forward MOS Networks”, IEEE Trans. Comput., C-26, № 6, 1977, 581
Keisuke Tanaka, Tetsuro Nishino, Robert Beals, “Negation-limited circuit complexity of symmetric functions”, Information Processing Letters, 59, № 5, 1996, 273
Krishnamoorthy Dinesh, Jayalal Sarma, 10743, Algorithms and Discrete Applied Mathematics, 2018, 260
William H. Kautz, “The Realization of Symmetric Switching Functions with Linear-Input Logical Elements”, IEEE Trans. Electron. Comput., EC-10, № 3, 1961, 371
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma, “New bounds for energy complexity of Boolean functions”, Theoretical Computer Science, 845, 2020, 59
K. Nakamura, N. Tokura, T. Kasami, “Minimal Negative Gate Networks”, IEEE Trans. Comput., C-21, № 1, 1972, 5