S.B. Akers, “On Maximum Inversion with Minimum Inverters”, IEEE Trans. Comput., C-17, № 2, 1968, 134
Siyao Guo, Ilan Komargodski, “Negation-limited formulas”, Theoretical Computer Science, 660, 2017, 75
Hung Chi Lai, Saburo Muroga, Advances in Information Systems Science, 1985, 287
Krishnamoorthy Dinesh, Jayalal Sarma, “Alternation, sparsity and sensitivity: Bounds and exponential gaps”, Theoretical Computer Science, 771, 2019, 71
Kazuyuki Amano, Akira Maruoka, Jun Tarui, “On the negation-limited circuit complexity of merging”, Discrete Applied Mathematics, 126, № 1, 2003, 3
Shao-Chin Sung, Keisuke Tanaka, “An exponential gap with the removal of one negation gate”, Information Processing Letters, 82, № 3, 2002, 155
Liu, “Synthesis of Feed-Forward MOS Networks with Cells of Similar Complexities”, IEEE Trans. Comput., C-26, № 8, 1977, 826
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma, 10976, Computing and Combinatorics, 2018, 738
Michael J. Fischer, 33, Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975, 1975, 71
Shao Chin Sung, Keisuke Tanaka, “Limiting negations in bounded-depth circuits: An extension of Markov's theorem”, Information Processing Letters, 90, № 1, 2004, 15