Ostonov, A., & Moshkov, M. (2024). Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE.
Chicago-referens (17:e uppl.)Ostonov, Azimkhon, och Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
MLA-referens (9:e uppl.)Ostonov, Azimkhon, och Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
Varning: dessa hänvisningar är inte alltid fullständigt riktiga.