The following pages link to Sven C. Polak (Q1711422):
Displayed 15 items.
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs (Q1711423) (← links)
- (Q1735701) (redirect page) (← links)
- Sum-perfect graphs (Q1735702) (← links)
- New nonbinary code bounds based on divisibility arguments (Q1741925) (← links)
- On the chromatic number of a subgraph of the Kneser graph (Q1792105) (← links)
- Uniqueness of codes using semidefinite programming (Q1999906) (← links)
- Semidefinite programming bounds for Lee codes (Q2312798) (← links)
- Semidefinite bounds for nonbinary codes based on quadruples (Q2364626) (← links)
- Semidefinite Programming Bounds for Constant-Weight Codes (Q4611411) (← links)
- Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory (Q5864695) (← links)
- Approximate pricing in networks: How to boost the betweenness and revenue of a node (Q5875574) (← links)
- A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938) (← links)
- Improved upper bound on A(18,8) (Q6280554) (← links)
- New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity (Q6340181) (← links)
- The maximum cardinality of trifferent codes with lengths 5 and 6 (Q6388528) (← links)