Sholomov, L. A. Theoretically effective asymptotically optimal universal coding of partially defined sources. (Russian. English summary) Zbl 1455.94088 Prikl. Diskretn. Mat. 2020, No. 47, 30-56 (2020). MSC: 94A29 × Cite Format Result Cite Review PDF Full Text: DOI MNR
Chashkin, Aleksandr V. On the average-case complexity of underdetermined functions. (English. Russian original) Zbl 1393.68070 Discrete Math. Appl. 28, No. 4, 201-221 (2018); translation from Diskretn. Mat. 29, No. 2, 133-159 (2017). MSC: 68Q25 68P05 94C10 × Cite Format Result Cite Review PDF Full Text: DOI
Andreev, Alexander E.; Clementi, Andrea E. F.; Rolim, José D. P. Efficient constructions of hitting sets for systems of linear functions. (English) Zbl 1499.68138 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 387-398 (1997). MSC: 68Q25 06E30 68Q06 68W20 × Cite Format Result Cite Review PDF Full Text: DOI
Andreev, Alexander E.; Clementi, Andrea E. F.; Rolim, José D. P. Optimal bounds for the approximation of Boolean functions and some applications. (English) Zbl 0911.94010 Theor. Comput. Sci. 180, No. 1-2, 243-268 (1997). MSC: 94C10 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI