On analysis of protoschemes

  • E. G. Belaga
Section C Computability, Decidability & Arithmetic Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Caratsuba A.A., Ofman Yu.P., The multiplication of multi-positional numbers by automata. Dokl. Akad. Nauk SSSR (in Russian), 145 (1962), 293–294.Google Scholar
  2. 2.
    Ofman Yu.P., The universal automaton. Trudy Mosk. Mathemat. Ob. (in Russian), vol.14 (1965), 186–199.Google Scholar
  3. 3.
    Schonhage A., Strassen V., Schnelle Multiplicationgrosser Zahlen. Computing, Archiv für elektronisches Rechnen, 7, 3 (1971), 281–292.Google Scholar
  4. 4.
    Harary F., Graph Theory, Addison-Wesley Co., Reading, Mass., 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • E. G. Belaga
    • 1
  1. 1.Institute of Control SciencesMoscowUSSR

Personalised recommendations