Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1987: Fundamentals of Computation Theory pp 14–16Cite as

Linearized disjunctive normal forms of boolean functions

  • Conference paper
  • First Online:

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

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

References

  1. Y.I. Zhuravlev. Set-theoretic methods in Logical Algebra, (Russian), Problemi Kibernetiki, 8, (1962), c. 5–54.

    Google Scholar 

  2. V.V. Glagolev. Some Estimations of Disjunctive Normal Forms of Functions of Logical Algebra., (Russian), Problemi Kibernetiki, 19 (1967), 75–94.

    Google Scholar 

  3. A.D. Korshunov. On the Complexity of the Shortest Disjunctive Normal Forms of Boolean ⊗ Functions. (Russian), Diskretni Analiz, 37, (1981), c. 9–41.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Yerevan State University, USSR

    A. A. Alexanyan

Authors
  1. A. A. Alexanyan
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Alexanyan, A.A. (1987). Linearized disjunctive normal forms of boolean functions. 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_4

Download citation

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

  • 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

Search

Navigation