"On Complexity of Deterministic and Nondeterministic Decision Trees for ..."

Azimkhon Ostonov, Mikhail Moshkov (2023)

> Home

Details and statistics

DOI: 10.3390/E25101411

access: open

type: Journal Article

metadata version: 2024-01-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/entropy/OstonovM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/OstonovM23
Azimkhon Ostonov, Mikhail Moshkov:
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes. Entropy 25(10): 1411 (2023)

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.