Sorting by decision trees with hypotheses (extended abstract)
Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov · King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology) · 2021
In this paper, we consider decision trees that use both queries based on one attribute each and queries based on hypotheses about values of all attributes. Such decision trees are similar to ones studied in exact learning, where not only membership but also equivalence queries are allowed. For n = 3,..., 6, we compare decision trees based on various combinations of attributes and hypotheses for sorting n pairwise different elements from linearly ordered set.