Ostonov, A., & Moshkov, M. (2024). Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE.
Chicago Style (17th ed.) CitationOstonov, Azimkhon, and Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
MLA (9th ed.) CitationOstonov, Azimkhon, and Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
Warning: These citations may not always be 100% accurate.