S.F. de Rezende, M. Göös, R. Robere, “Guest Column”, SIGACT News, 53, № 1, 2022, 59
H. van Ditmarsch, P. Iliev, “The succinctness of the cover modality”, Journal of Applied Non-Classical Logics, 25, № 4, 2015, 373
K. L. Rychkov, “Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes”, J. Appl. Ind. Math., 12, № 3, 2018, 540
Oriol Farràs, Jordi Ribes-González, Sara Ricci, “Local bounds for the optimal information ratio of secret sharing schemes”, Des. Codes Cryptogr., 87, № 6, 2019, 1323
Philippe Balbiani, David Fernández-Duque, Andreas Herzig, Petar Iliev, “Frame-validity Games and Lower Bounds on the Complexity of Modal Axioms”, Logic Journal of the IGPL, 30, № 1, 2022, 155
M. Karchmer, E. Kushilevitz, N. Nisan, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992, 262
Alexander A. Sherstov, 8634, Mathematical Foundations of Computer Science 2014, 2014, 24
K. L. Rychkov, “Representations of Normalized Formulas”, J. Appl. Ind. Math., 16, № 4, 2022, 760
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
J. Korner, A. Orlitsky, “Zero-error information theory”, IEEE Trans. Inform. Theory, 44, № 6, 1998, 2207