Skip to main content
SpringerLink
Log in
Book cover

Comparative Analysis of Deterministic and Nondeterministic Decision Trees pp 93–103Cite as

Closed Classes of Boolean Functions

  • Chapter
  • First Online:

  • 335 Accesses

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 179))

Abstract

In this chapter, for decision tables corresponding to functions from an arbitrary closed class of Boolean functions, the depth of deterministic, nondeterministic, and strongly nondeterministic decision trees is studied. The obtained results have some independent interest. Proofs of these results illustrate mainly methods for the proof of lower bounds on complexity of decision trees.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Moshkov, M.: About the depth of decision trees computing Boolean functions. Fundam. Inform. 22(3), 203–215 (1995)

    Article  MathSciNet  Google Scholar 

  2. Moshkov, M.: Time complexity of decision trees. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III, Lecture Notes in Computer Science, vol. 3400, pp. 244–459. Springer, Berlin (2005)

    Google Scholar 

  3. Post, E.: Introduction to a general theory of elementary propositions. Am. J. Math. 43, 163–185 (1921)

    Article  MathSciNet  Google Scholar 

  4. Post, E.: Two-Valued Iterative Systems of Mathematical Logic. Annals of Mathematics Studies, vol. 5. Princeton University Press, Princeton-London (1941)

    Google Scholar 

  5. Yablonskii, S.V., Gavrilov, G.P., Kudriavtzev, V.B.: Functions of the Algebra of Logic and Post Classes. Nauka Publishers, Moscow (1966). (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer, Electrical and Mathematical Science and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia

    Mikhail Moshkov

Authors
  1. Mikhail Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mikhail Moshkov .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Moshkov, M. (2020). Closed Classes of Boolean Functions. In: Comparative Analysis of Deterministic and Nondeterministic Decision Trees. Intelligent Systems Reference Library, vol 179. Springer, Cham. https://doi.org/10.1007/978-3-030-41728-4_7

Download citation

Publish with us

Policies and ethics

Search

Navigation