Totally optimal decision trees for Boolean functions (Q323025): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimization and analysis of decision trees and rules: dynamic programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average time complexity of decision trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Binary Identification Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact learning when irrelevant variables abound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto-optimal patterns in logical analysis of data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Innovations in intelligent machines. 4. Recent advances in knowledge engineering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing optimal binary decision trees is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5505175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing decision trees through heuristically guided search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transactions on Rough Sets III / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognizing graph properties from adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthetic approach to decision table conversion / rank
 
Normal rank

Latest revision as of 16:14, 12 July 2024

scientific article
Language Label Description Also known as
English
Totally optimal decision trees for Boolean functions
scientific article

    Statements

    Totally optimal decision trees for Boolean functions (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    Boolean functions
    0 references
    monotone Boolean functions
    0 references
    totally optimal decision trees
    0 references
    time complexity
    0 references
    space complexity
    0 references
    0 references
    0 references

    Identifiers