Skip to main content

On the complexity of elementary periodical functions realized by switching circuits

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

  • 142 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cardot C. Quelques resultats sur l'application de l'algebre de Boole a la synthse des circuits a relais. — Annles des Telecommunications, 7,2, 1952,p.75–84.

    Google Scholar 

  2. Лупанов О.В. К вопросу о реализации симметрических функций алгебры логики контактными схемами. — Проблемы кибернетикн, 1965, вып. 15, 85–99.

    Google Scholar 

  3. Caldwell S.H. Switching circuits and logical design. — N.Y., 1958.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grinchuk, M.I. (1987). On the complexity of elementary periodical functions realized by switching circuits. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics