Pages that link to "Item:Q4234113"
From MaRDI portal
The following pages link to Randomized graph products, chromatic numbers, and Lovasz j-function (Q4234113):
Displaying 12 items.
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
- Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
- New lower bounds for the Shannon capacity of odd cycles (Q2364621) (← links)
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs (Q2383537) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
- Clique, chromatic, and Lovász numbers of certain circulant graphs (Q3439129) (← links)
- Orthonormal representations, vector chromatic number, and extension complexity (Q6644170) (← links)