Citace podle APA (7th ed.)

Ostonov, A., & Moshkov, M. (2024). Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE access, 12, 164979-164988. https://doi.org/10.1109/ACCESS.2024.3487514

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 Access 12 (2024): 164979-164988. https://doi.org/10.1109/ACCESS.2024.3487514.

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 Access, vol. 12, 2024, pp. 164979-164988, https://doi.org/10.1109/ACCESS.2024.3487514.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..