Ostonov, A., & Moshkov, M. (2024). Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE.
Citace podle Chicago (17th ed.)Ostonov, Azimkhon, a Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
Citace podle MLA (9th ed.)Ostonov, Azimkhon, a Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..