Pages that link to "Item:Q4178914"

The following pages link to On the Shannon capacity of a graph (Q4178914):

Displaying 50 items.

• Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
• The sheaf-theoretic structure of non-locality and contextuality (Q5135226) (← links)
• Quantum Probability Aspects to Lexicographic and Strong Products of Graphs (Q5135272) (← links)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
• Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
• Quantitative geometry (Q5170979) (← links)
• Quantum nonlocality enhanced by homogenization (Q5175595) (← links)
• High-accuracy solution of large-scale semidefinite programs (Q5200555) (← links)
• A robust algorithm for semidefinite programming (Q5200556) (← links)
• (Q5202209) (← links)
• A survey on graphs with convex quadratic stability number (Q5207733) (← links)
• New results for recognizing convex-<i>QP</i> adverse graphs (Q5207738) (← links)
• A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations (Q5216778) (← links)
• Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian (Q5217598) (← links)
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
• Cliques and colorings in generalized Paley graphs and an approach to synchronization (Q5251112) (← links)
• On outindependent subgraphs of strongly regular graphs (Q5291789) (← links)
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
• Resource convertibility and ordered commutative monoids (Q5360212) (← links)
• On the Normalized Shannon Capacity of a Union (Q5366919) (← links)
• Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability (Q5366954) (← links)
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
• Exclusivity structures and graph representatives of local complementation orbits (Q5407615) (← links)
• A cross-intersection theorem for vector spaces based on semidefinite programming (Q5409116) (← links)
• Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
• Communication Lower Bounds Via the Chromatic Number (Q5458837) (← links)
• (Q5708617) (← links)
• (Q5743408) (← links)
• Linear game non-contextuality and Bell inequalities—a graph-theoretic approach (Q5855038) (← links)
• (Q5870293) (← links)
• Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
• Noncontextual coloring of orthogonality hypergraphs (Q5883898) (← links)
• Homomorphisms of strongly regular graphs (Q5892300) (← links)
• Quadratic forms on graphs (Q5896810) (← links)
• Semidefinite programming and combinatorial optimization (Q5906394) (← links)
• Independence numbers of product graphs (Q5906581) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• Constructive lower bounds for off-diagonal Ramsey numbers (Q5935811) (← links)
• Relative capacity and dimension of graphs (Q5937942) (← links)
• Unextendible product bases (Q5940308) (← links)
• The minimum rank problem for circulants (Q5962494) (← links)
• Estimating quantum chromatic numbers (Q5963425) (← links)
• A characterization of the weighted Lovász number based on convex quadratic programming (Q5963688) (← links)
• Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
• Approximately counting independent sets in bipartite graphs via graph containers (Q6074723) (← links)
• On Sidorenko's conjecture for determinants and Gaussian Markov random fields (Q6074867) (← links)
• Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions (Q6074962) (← links)
• Extremal Problem for Matchings and Rainbow Matchings on Direct Products (Q6077978) (← links)