Ostonov, A., & Moshkov, M. (2024). Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE.
Цитирование в стиле Чикаго (17-е изд.)Ostonov, Azimkhon, и Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
Цитирование MLA (9-е изд.)Ostonov, Azimkhon, и Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
Предупреждение: эти цитированмия не могут быть всегда правильны на 100%.