Martin Sauerhoff, 2607, STACS 2003, 2003, 307
Beate Bollig, 1893, Mathematical Foundations of Computer Science 2000, 2000, 222
Satyanarayana V. Lokam, “Spectral Methods for Matrix Rigidity with Applications to Size–Depth Trade-offs and Communication Complexity”, Journal of Computer and System Sciences, 63, № 3, 2001, 449
Paul Beame, Erik Vee, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002, 688
Beate Bollig, “Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication”, RAIRO-Theor. Inf. Appl., 35, № 2, 2001, 149
Farid Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev, 11011, Adventures Between Lower Bounds and Higher Altitudes, 2018, 129
K. Khadiev, “Width hierarchy for k-OBDD of small width”, Lobachevskii J Math, 36, № 2, 2015, 178
P. Woelfel, Proceedings 17th IEEE Annual Conference on Computational Complexity, 2002, 80
R.K. Sinha, J.S. Thathachar, Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994, 309
Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida, “One-Tape Turing Machine and Branching Program Lower Bounds for MCSP”, Theory Comput Syst, 2022