No label defined (Q5121897)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7250149

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7250149

Statements

scholarly article

0 references

publication date

22 September 2020

0 references

zbMATH Keywords

communication complexity

0 references

small advantage

0 references

MaRDI profile type

MaRDI publication profile

0 references

An information statistics approach to data stream and communication complexity

0 references

From information to exact communication

0 references

An information complexity approach to extended formulations

0 references

Information Equals Amortized Communication

0 references

Beyond set disjointness

0 references

Certifying Equality With Limited Interaction.

0 references

An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

0 references

0 references

0 references

Rectangles Are Nonnegative Juntas

0 references

The Landscape of Communication Complexity Classes.

0 references

0 references

0 references

Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas

0 references

Two applications of information complexity

0 references

Communication Complexity

0 references

Lower bounds on the randomized communication complexity of read-once functions

0 references

On the distributional complexity of disjointness

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.CCC.2018.9

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5121897

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5121897&oldid=36618670"