Pages that link to "Item:Q817830"
From MaRDI portal
The following pages link to On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes (Q817830):
Displaying 5 items.
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Learning Complexity vs Communication Complexity (Q3557511) (← links)
- (Q4420745) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)