Representing Boolean Functions by Decision Trees

Handle URI:
http://hdl.handle.net/10754/561673
Title:
Representing Boolean Functions by Decision Trees
Authors:
Chikalov, Igor
Abstract:
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Publisher:
Springer Science + Business Media
Journal:
Average Time Complexity of Decision Trees
Issue Date:
2011
DOI:
10.1007/978-3-642-22661-8_3
Type:
Article
ISSN:
18684394
ISBN:
9783642226601
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorChikalov, Igoren
dc.date.accessioned2015-08-03T09:02:00Zen
dc.date.available2015-08-03T09:02:00Zen
dc.date.issued2011en
dc.identifier.isbn9783642226601en
dc.identifier.issn18684394en
dc.identifier.doi10.1007/978-3-642-22661-8_3en
dc.identifier.urihttp://hdl.handle.net/10754/561673en
dc.description.abstractA Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.en
dc.publisherSpringer Science + Business Mediaen
dc.titleRepresenting Boolean Functions by Decision Treesen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalAverage Time Complexity of Decision Treesen
kaust.authorChikalov, Igoren
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.