scientific article; zbMATH DE number 7378625
From MaRDI portal
Publication:5009505
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.13MaRDI QIDQ5009505
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1802.03920
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Sperner capacity of the cyclic triangle
- The ellipsoid method and its consequences in combinatorial optimization
- Intersection theorems with geometric consequences
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- On the complexity of approximating the independent set problem
- A note on Euclidean Ramsey theory and a construction of Bourgain
- On t-designs
- The Shannon capacity of a union
- The sandwich theorem
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function
- Approximating the independence number via the \(\vartheta\)-function
- Information flows, graphs and their guessing numbers
- Orthogonal representations over finite fields and the chromatic number of graphs
- Index Coding—An Interference Alignment Perspective
- H-wise independence
- Matching Vector Codes
- A counterexample to Borsuk’s conjecture
- On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors
- Forbidden Intersections
- Approximate graph coloring by semidefinite programming
- On the Shannon capacity of a graph
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- Boolean Circuits, Tensor Ranks, and Communication Complexity
- Network information flow
- The Minrank of Random Graphs
- Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
- Nonlinear Index Coding Outperforming the Linear Optimum
- Index Coding With Side Information
- On the Hardness of Approximating the Network Coding Capacity
- Topological Interference Management Through Index Coding
- Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate
- Linear Index Coding via Semidefinite Programming
- Automata, Languages and Programming
- The Lovász Number of Random Graphs
This page was built for publication:
