Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. Ágoston, I., Demetrovics, J., Hannák, L.: On the number of clones containing all constants (a problem of R. McKenzie). In: Lectures in Universal Algebra (Szeged, 1983), Colloq. Math. Soc. János Bolyai, vol. 43, pp. 21–25. North-Holland, Amsterdam (1986)
2. Bulitko V.K.: Reducibility by Zhegalkin-linear tables. Sib. Math. J. 21(3), 332–339 (1980)
3. Degtev A.: Comparison of linear reducibility with other reducibilities of tabular type. Algebra Logic Russ. 21(5), 339–353 (1982)
4. Downey R., Hirschfeldt D.: Algorithmic Randomness and Complexity. Springer, Secaucus (2010)
5. Folland, G.B.: Real Analysis, 2nd ed. Pure and Applied Mathematics (New York). Wiley, New York (1999); Modern techniques and their applications, A Wiley-Interscience Publication