Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
The article considers the representation of Boolean functions in the form of decision trees. It presents the bounds on average time complexity of decision trees for all classes of Boolean functions that are closed over substitution, and the insertion and deletion of unessential variables (the structure of these classes is described in the book by Jablonsky, Gavrilov and Kudriavtzev [5]). The obtained results are compared with the results developed by Moshkov in [6] that describe the worst case time complexity of decision trees.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
265--284
Opis fizyczny
bibliogr. 9 poz.
Twórcy
autor
- Faculty of Computing Mathematics and Cybernetics of Nizhni Novgorod State University, 23, Gagarina Av., Nizhni Novgorod, 603950, Russia, igor.chikalov@intel.com
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0004-0013