Ostonov, A., & Moshkov, M. (2024). Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE.
Chicago-Zitierstil (17. Ausg.)Ostonov, Azimkhon, und Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
MLA-Zitierstil (9. Ausg.)Ostonov, Azimkhon, und Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.