Advertisement

The parallel complexity of some arithmetic and algebraic operations

  • I. K. Rystsov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chandra K., Stockmeyer L., Vishkin U. Constant depth reducibility. // SIAM J.Computer. — 1984 —13,No.2 — p.288–299.Google Scholar
  2. 2.
    Beam P.,Cook S.,Hoover H. Log-depth circiuts and related problems. // 25-th Annual Symp. on Found. of Computer Science. — N.Y.: 1984–p.1–6.Google Scholar
  3. 3.
    Furst M.,Saxe J.,Sipser M. Parity,circuits and polynomial time hierarchy. // Math. Systems Theory. — 1984 — 17,No.1 — p.13–27.Google Scholar
  4. 4.
    Lupanov O.B. Ob odnom podkhode k sintezu upravlyaushchikh sistem — printsipe lokalnogo kodirovaniya. // Problemy kibernetiki. — M.: Nauka, 1965 —14 — s.31 — 110 (in Russian).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • I. K. Rystsov
    • 1
  1. 1.Institute of CyberneticsKievUSSR

Personalised recommendations