Pages that link to "Item:Q4178914"
From MaRDI portal
The following pages link to On the Shannon capacity of a graph (Q4178914):
Displaying 36 items.
- Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)
- The core of a complementary prism (Q6083960) (← links)
- Semidefinite programming and its applications to NP problems (Q6085755) (← links)
- A Sum of Squares Characterization of Perfect Graphs (Q6087752) (← links)
- The zero-error capacity of binary channels with 2-memories (Q6089460) (← links)
- Local orthogonality dimension (Q6094036) (← links)
- A geometric approach to betweenness (Q6102303) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming (Q6116234) (← links)
- Approximation of the Shannon capacity via matrix cone programming (Q6151010) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
- Hypergraph LSS-ideals and coordinate sections of symmetric tensors (Q6172839) (← links)
- Lower bound on the minimum number of edges in subgraphs of Johnson graphs (Q6173476) (← links)
- Inclusion matrices for rainbow subsets (Q6185748) (← links)
- On the complete description of entangled systems. I: Exploring hidden variables and context communication cost in simulating quantum correlations (Q6186289) (← links)
- Perfect and nearly perfect separation dimension of complete and random graphs (Q6186984) (← links)
- Quantum hypergraph homomorphisms and non-local games (Q6190568) (← links)
- (Q6199224) (← links)
- Odd distances in colourings of the plane (Q6201484) (← links)
- Quantum no-signalling correlations and non-local games (Q6559092) (← links)
- Semi-definite programming and quantum information (Q6561827) (← links)
- A note on acyclic coloring of strong product of graphs (Q6571585) (← links)
- A feasible method for general convex low-rank SDP problems (Q6573007) (← links)
- On different versions of the exact subgraph hierarchy for the stable set problem (Q6585245) (← links)
- Graph coloring and semidefinite rank (Q6589762) (← links)
- Colouring strong products (Q6612523) (← links)
- How to hide a clique? (Q6614612) (← links)
- Sum-of-squares certificates for copositivity via test states (Q6624426) (← links)
- Redundancy of codes with graph constraints (Q6629091) (← links)
- The inertia bound is far from tight (Q6634558) (← links)
- Shannon meets Myerson: information extraction from a strategic sender (Q6637008) (← links)
- Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph (Q6639684) (← links)
- Orthonormal representations, vector chromatic number, and extension complexity (Q6644170) (← links)
- Bootstrap percolation in strong products of graphs (Q6671566) (← links)