Totally optimal decision trees for Boolean functions-Reference-Cited by-同舟云学术

Totally optimal decision trees for Boolean functions

Published:2016-12 Issue: Volume:215 Page:1-13
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Chikalov Igor,Hussain Shahid^ORCID,Moshkov Mikhail

Funder

King Abdullah University of Science and Technology

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference22 articles.

1. Dagger: a tool for analysis and optimization of decision trees and rules;Alkhalid,2011

2. Optimization and analysis of decision trees and rules: dynamic programming approach;Alkhalid;Int. J. Gen. Syst.,2013

3. Paul Beame, Michael E. Saks, Jayram S. Thathachar, Time-space tradeoffs for branching programs, in: 39th Annual Symposium on Foundations of Computer Science, FOCS ’98, November 8-11, 1998, Palo Alto, California, USA, 1998, pp. 254–263.

4. Complexity measures and decision tree complexity: a survey;Buhrman;Theoret. Comput. Sci.,2002

5. Average Time Complexity of Decision Trees;Chikalov,2011

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Conversational recommendation: Theoretical model and complexity analysis;Information Sciences;2022-10

2. Time and space complexity of deterministic and nondeterministic decision trees;Annals of Mathematics and Artificial Intelligence;2022-09-09

3. Multi-Stage Optimization and Counting Optimal Elements;Dynamic Programming Multi-Objective Combinatorial Optimization;2021

4. Knowledge Representation Using Decision Trees Constructed Based on Binary Splits;KSII Transactions on Internet and Information Systems;2020-10-31

5. Decision Trees with at Most 19 Vertices for Knowledge Representation;Transactions on Rough Sets XXII;2020