The minrank of random graphs (Q5002652): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
label / enlabel / en
 
The minrank of random graphs
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.46 / rank
Normal rank
 
Property / author
 
Property / author: Oded Regev / rank
Normal rank
 
Property / author
 
Property / author: Oded Regev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network information flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index Coding With Side Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Index Coding via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Equivalence Between Network Coding and Index Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Problems of Lovász Concerning the Shannon Capacity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected values of parameters associated with the minimum rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-rank conjecture for log-depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Index Coding Outperforming the Linear Optimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards polynomial lower bounds for dynamic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Circuits, Tensor Ranks, and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information flows, graphs and their guessing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Small-Depth Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed source coding for satellite communications / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://dblp.uni-trier.de/db/conf/approx/approx2017.html#Golovnev0W17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2898680372 / rank
 
Normal rank
Property / title
 
The minrank of random graphs (English)
Property / title: The minrank of random graphs (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.APPROX-RANDOM.2017.46 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:35, 30 December 2024

scientific article; zbMATH DE number 7375851
Language Label Description Also known as
English
The minrank of random graphs
scientific article; zbMATH DE number 7375851

    Statements

    0 references
    0 references
    0 references
    28 July 2021
    0 references
    circuit complexity
    0 references
    index coding
    0 references
    information theory
    0 references
    The minrank of random graphs (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references