"Complexity of Deterministic and Strongly Nondeterministic Decision Trees ..."

Azimkhon Ostonov, Mikhail Moshkov (2024)

> Home

Details and statistics

DOI: 10.1109/ACCESS.2024.3487514

access: open

type: Journal Article

metadata version: 2024-11-30

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/access/OstonovM24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/OstonovM24
Azimkhon Ostonov, Mikhail Moshkov:
Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes. IEEE Access 12: 164979-164988 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.