William H. Kautz, “A Survey and Assessment of Progress in Switching Theory and Logical Design in the Soviet Union”, IEEE Trans. Electron. Comput., EC-15, № 2, 1966, 164
Tao Feng, Li-C Wang, Kwang-Ting (Tim) Cheng, Chih-Chang (Andy) Lin, “Using 2-domain partitioned OBDD data structure in an enhanced symbolic simulator”, ACM Trans. Des. Autom. Electron. Syst., 10, № 4, 2005, 627
Christos A. Papachristou, “Characteristic measures of switching functions”, Information Sciences, 13, № 1, 1977, 51
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma, 12273, Computing and Combinatorics, 2020, 287
Vadim V. Kochergin, Anna V. Mikhailovich, “The minimum number of negations in circuits for systems of multi-valued functions”, Discrete Mathematics and Applications, 27, № 5, 2017, 295
C. S. Lorens, “Invertible Boolean Functions”, IEEE Trans. Electron. Comput., EC-13, № 5, 1964, 529
Richard Beigel, “Bounded queries to SAT and the Boolean hierarchy”, Theoretical Computer Science, 84, № 2, 1991, 199
J.J. Liu, L.D. Rudolph, “A Direct Method of Computing the GNAF of an Integer”, IEEE Trans. Comput., C-24, № 10, 1975, 1042
Norbert Blum, 5760, Efficient Algorithms, 2009, 18
Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka, 1160, Algorithmic Learning Theory, 1996, 12