Литература

Afrati F. Introduction to the theory of information (in Greek). National Technical University of Athens, Greece, 1985.

Akritas A.G., Danielopoulos S.D. On the complexity of algorithms for the translation of polynomials. Computing 24, 51-60, 1980.

Albert A.A. Fundamental concepts of higher algebra. University of Chicago Press, Chicago, 1958.

Berlekamp E.R. Algebraic coding theory. McGraw-Hill, New York, 1968. [Имеется перевод: Берлекэмп Э. Алгебраическая теория кодирования. М.: Мир, 1974.]

Cajori F. Horner’s method of approximation anticipated by Ruffini. American Society Bulletin 17, 409-414, 1911.

Childs L. A concrete introduction to higher algebra. Springer-Verlag, New York, 1979.

Knuth D.E. The art of computer programming, Vol. 2, 2nd ed. Seminu-merical algorithms. Addison-Wesley, Reading, MA, 1981. [Имеется перевод первого издания: Кнут Д. Искусство программирования для ЭВМ. Т. 2. — М.: Мир, 1977.]

Netto Е. Vorlesungen iiber Algebra. Erster Band. Teubner, Leipzig, 1896.

Sims C.C. Abstract algebra, a computational approach. Wiley, New York, 1984.

Taub H. Digital circuits and microprocessors. McGraw-Hill, New York, 1982.

Wang S.P., Trager B.T. New algorithms for polynomial square-free decompositions over the integers. SIAM Journal on Computing 8, 300-305, 1979.

Yun D.Y.Y. On square-free decomposition algorithms. Proceedings of the 1976 SYMSAC (Yorktown Heights, NY), 26-35, 1976.