One more method for proving lower bounds on the formula complexity of boolean functions

Stetsenko, V. A.

doi:10.1007/3-540-51486-4_96

V. A. Stetsenko¹

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

Included in the following conference series:

International Symposium on Mathematical Foundations of Computer Science

146 Accesses

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.

References

Harary F. Graph Theory, 1969.
Google Scholar
Vasil'ev Y.L. On superposition of curtailed disujnctive normal form, Problemy Kibernet., 12 (1964), pp. 239–242 (Russian).
Google Scholar

Download references

Author information

Authors and Affiliations

Dept. of Informatics, State Pedagogical Institute, Krasnoprydnaja 14, 107140, Moscow, USSR
V. A. Stetsenko

Authors

V. A. Stetsenko
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Antoni Kreczmar Grazyna Mirkowska

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Stetsenko, V.A. (1989). One more method for proving lower bounds on the formula complexity of boolean functions. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_96

Download citation

DOI: https://doi.org/10.1007/3-540-51486-4_96
Published: 25 May 2005
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51486-2
Online ISBN: 978-3-540-48176-8
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics