A note on hardness of computing recursive teaching dimension (Q6072213)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7749690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on hardness of computing recursive teaching dimension |
scientific article; zbMATH DE number 7749690 |
Statements
A note on hardness of computing recursive teaching dimension (English)
0 references
12 October 2023
0 references
recursive teaching dimension
0 references
computational complexity
0 references
fine-grained complexity
0 references
0 references
0 references
0.8076452016830444
0 references
0.7733244299888611
0 references
0.7624515891075134
0 references
0.755769670009613
0 references
0.7393976449966431
0 references
