"Comparison of Complexity of Regular Versus Oblivious Decision Trees for ..."

Azimkhon Ostonov, Mikhail Moshkov (2025)

> Home

Details and statistics

DOI: 10.1109/ACCESS.2025.3610956

access: open

type: Journal Article

metadata version: 2025-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/access/OstonovM25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/OstonovM25
Azimkhon Ostonov, Mikhail Moshkov:
Comparison of Complexity of Regular Versus Oblivious Decision Trees for Decision Tables With Many-Valued Decisions From Closed Classes. IEEE Access 13: 164464-164473 (2025)

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.