Pages that link to "Item:Q5281090"
From MaRDI portal
The following pages link to On the Hardness of Approximating the Network Coding Capacity (Q5281090):
Displaying 7 items.
- Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
- Network coding, does the model need tuning? (Q2921706) (← links)
- (Q5009505) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- (Q5743408) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- Local orthogonality dimension (Q6094036) (← links)