11 citations to https://www.mathnet.ru/eng/ic1
-
Kordag Mehmet Kilic, Jin Sima, Jehoshua Bruck, 2023 IEEE International Symposium on Information Theory (ISIT), 2023, 1663
-
Taisuke Sato, Katsumi Inoue, “Differentiable learning of matricized DNFs and its application to Boolean networks”, Mach Learn, 112:8 (2023), 2821
-
Akihiro Kawana, Tomomi Matsui, “Trading transforms of non-weighted simple games and integer weights of weighted simple games”, Theory Decis, 93:1 (2022), 131
-
Péter Hajnal, Zhihao Liu, György Turán, “Nearest neighbor representations of Boolean functions”, Information and Computation, 285 (2022), 104879
-
Arkadev Chattopadhyay, Nikhil S. Mande, “A Short List of Equalities Induces Large Sign-Rank”, SIAM J. Comput., 51:3 (2022), 820
-
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan, “A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates”, Algorithmica, 84:4 (2022), 1132
-
Elena Zamaraeva, Joviša Žunić, “A characterization of 2-threshold functions via pairs of prime segments”, Theoretical Computer Science, 919 (2022), 1
-
L. Babai, K. A. Hansen, V. V. Podolskii, Xiaoming Sun, “Weights of exact threshold functions”, Izv. Math., 85:6 (2021), 1039–1059
-
Elena Zamaraeva, Joviša Žunić, “Asymptotics of the number of 2-threshold functions”, Information and Computation, 281 (2021), 104742
-
Arkadev Chattopadhyay, Nikhil Mande, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, 47