Skip to main content
SpringerLink
Log in

On the length of single dynamic tests for monotone boolean functions

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

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Si, S.-C.: Dynamic testing of redundant logic networks. IEEE Trans. on Comput., C-27, No. 9, 828–832 (1978).

    Google Scholar 

  2. Yuan, Y.; Chen, T.: The dynamic testing of combinational logic networks. Proc. 12th Int. Symp. Fault-Tolerant Comput., Santa Monica/Calif. 1982, New York, N.Y., 173–180 (1982).

    Google Scholar 

  3. Petrosian, A.V.: Some differential properties of Boolean functions. Tanulmányok, Budapest, No. 135, 15–37 (Russian) (1982).

    Google Scholar 

  4. Vardanian, V.A.: On the complexity of dynamic tests for Boolean functions. Dokl. Akad. Nauk Arm. SSR, 77, No. 3, 113–116 (Russian) (1983).

    Google Scholar 

  5. Korshunov, A.D.: On the number of monotone Boolean functions. Problemy Kibernetiki, Moskva: "Nauka", 38, 5–108 (Russian) (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center of the Academy of Sciences of Armenian SSR, 375044, Yerevan, USSR

    V. A. Vardanian

Authors
  1. V. A. Vardanian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vardanian, V.A. (1985). On the length of single dynamic tests for monotone boolean functions. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028828

Download citation

  • DOI: https://doi.org/10.1007/BFb0028828

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation