V. M. Khrapchenko, “Method of determining lower bounds for the complexity of $P$-schemes”, Mat. Zametki, 10:1 (1971), 83–92; Math. Notes, 10:1 (1971), 474

This publication is cited in the following 51 articles:

K. L. Rychkov, “O stroenii odnogo klassa sovershennykh $\Pi$ -razbienii”, Sib. elektron. matem. izv., 20:2 (2023), 1499–1518
Or Meir, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, 1056
Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov, “Improving $3N$ Circuit Complexity Lower Bounds”, comput. complex., 32:2 (2023)
K. L. Rychkov, “Predstavleniya normalizovannykh formul”, Diskretn. analiz i issled. oper., 29:4 (2022), 77–103
Jiatu Li, Tianqi Yang, Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, 1180
I. S. Sergeev, “Formula Complexity of a Linear Function in a $k$ -ary Basis”, Math. Notes, 109:3 (2021), 445–458
Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira, “Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates”, ACM Trans. Comput. Theory, 13:4 (2021), 1
S. B. Gashkov, I. S. Sergeev, “O znachenii rabot V. M. Khrapchenko”, PDM, 2020, no. 48, 109–124
Susanna F. de Rezende, Or Meir, Jakob Nordstrom, Toniann Pitassi, Robert Robere, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 43
K. L. Rychkov, “O sovershennosti minimalnykh pravilnykh razbienii mnozhestva reber $n$ -mernogo kuba”, Diskretn. analiz i issled. oper., 26:4 (2019), 74–107
K. L. Rychkov, “Complexity of the realization of a linear Boolean function in the class of $\pi$ -schemes”, J. Appl. Industr. Math., 12:3 (2018), 540–576
Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov, “On the limits of gate elimination”, Journal of Computer and System Sciences, 96 (2018), 107
I. S. Sergeev, “Upper bounds for the size and the depth of formulae for MOD-functions”, Discrete Math. Appl., 27:1 (2017), 15–22
Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016, 89
K. L. Rychkov, “Sufficient conditions for the minimal $\pi$ -schemes for linear Boolean functions to be locally non-repeating”, J. Appl. Industr. Math., 9:4 (2015), 580–587
I. S. Sergeev, “Upper bounds on the formula size of symmetric Boolean functions”, Russian Math. (Iz. VUZ), 58:5 (2014), 30–42
S. B. Gashkov, E. T. Shavgulidze, “Representation of monomials as a sum of powers of linear forms”, Moscow University Mathematics Bulletin, 69:2 (2014), 51–55
Yu. L. Vasil'ev, K. L. Rychkov, “A lower bound on formula size of a ternary linear function”, J. Appl. Industr. Math., 7:4 (2013), 588–596
V. M. Khrapchenko, “A simplified proof of a lower complexity estimate”, Discrete Math. Appl., 23:2 (2013), 171–174
Ilan Komargodski, Ran Raz, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 171