Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan, “A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates”, Algorithmica, 84, no. 4, 2022, 1132
Kei Uchizawa, Eiji Takimoto, 6907, Mathematical Foundations of Computer Science 2011, 2011, 568
Lijie Chen, Hanlin Ren, “Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization”, SIAM J. Comput., 51, no. 3, 2022, STOC20-115
Daniel M. Kane, Ryan Williams, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016, 633
Emanuele Viola, “Selected challenges in computational lower bounds”, SIGACT News, 48, no. 1, 2017, 39
Nikhil Vyas, R. Ryan Williams, “Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms”, Theory Comput Syst, 67, no. 1, 2023, 149
Kazuyuki Amano, 12038, Language and Automata Theory and Applications, 2020, 235
Laszlo Babai, Kristoffer Arnsfelt Hansen, Vladimir Vladimirovich Podolskii, Xiaoming Sun, “Веса точных пороговых функций”, Известия Российской академии наук. Серия математическая, 85, no. 6, 2021, 5
L. Babai, K. A. Hansen, V. V. Podolskii, Xiaoming Sun, “Weights of exact threshold functions”, Izv. Math., 85, no. 6, 2021, 1039
Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, 8087, Mathematical Foundations of Computer Science 2013, 2013, 516