Dyfyniad APA

Ostonov, A., & Moshkov, M. (2024). Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE.

Dyfyniad Arddull Chicago

Ostonov, Azimkhon, and Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.

Dyfyniad MLA

Ostonov, Azimkhon, and Mikhail Moshkov. Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE, 2024.

Rhybudd: Mae'n bosib nad yw'r dyfyniadau hyn bob amser yn 100% cywir.