Minimization of decision trees is hard to approximate (Q2475411): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2007.06.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026324637 / rank | |||
Normal rank | |||
Revision as of 22:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimization of decision trees is hard to approximate |
scientific article |
Statements
Minimization of decision trees is hard to approximate (English)
0 references
11 March 2008
0 references
decision tree
0 references
nonapproximability
0 references
