Ostonov, A., & Moshkov, M. (2024). Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE.
Παραπομπή σε μορφή Chicago (17η εκδ.)Ostonov, Azimkhon, και Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
Παραπομπή σε μορφή MLA (9th εκδ.)Ostonov, Azimkhon, και Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
Πρόσοχή: Οι παραπομπές μπορεί να μην είναι 100% ακριβείς.