Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Moshkov, Mikhail
Affiliations: Research Institute for Applied Mathematics and Cybernetics of the Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia
Abstract: Lower and upper bounds for the depth of decision trees computing Boolean functions are established and Shannon functions of the decision tree depth are determined for closed classes of Boolean functions.
DOI: 10.3233/FI-1995-2231
Journal: Fundamenta Informaticae, vol. 22, no. 3, pp. 203-215, 1995
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]