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

Azimkhon Ostonov, Mikhail Moshkov (2024)

> Home

Details and statistics

DOI: 10.1007/978-3-031-65665-1_11

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/rskt/OstonovM24a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rskt/OstonovM24a
Azimkhon Ostonov, Mikhail Moshkov:
On Complexity of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-Valued Decisions from Closed Classes. IJCRS (1) 2024: 173-187

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.