A discrepancy lower bound for information complexity (Q343867): Difference between revisions

Latest revision as of 23:55, 12 July 2024

scientific article; zbMATH DE number 6101564

A Discrepancy Lower Bound for Information Complexity

Language	Label	Description	Also known as
English	A discrepancy lower bound for information complexity	scientific article; zbMATH DE number 6101564	A Discrepancy Lower Bound for Information Complexity

Statements

instance of

scholarly article

0 references

title

A discrepancy lower bound for information complexity (English)

0 references

A Discrepancy Lower Bound for Information Complexity (English)

0 references

0 references

0 references

0 references

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

0 references

publication date

29 November 2016

0 references

2 November 2012

0 references

full work available at URL

https://arxiv.org/abs/1112.2000

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A full proof of the BGW protocol for perfectly secure multiparty computation

0 references

How to compress interactive communication

0 references

Information Equals Amortized Communication

0 references

Interactive information complexity

0 references

Privacy, additional information and communication

0 references

An information statistics approach to data stream and communication complexity

0 references

A Zero-One Law for Boolean Privacy

0 references

Quantum and approximate privacy

0 references

Exponential Separation of Information and Communication for Boolean Functions

0 references

The Communication Complexity of Correlation

0 references

Towards proving strong direct product theorems

0 references

A strong direct product theorem for disjointness

0 references

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications

0 references

Communication Complexity

0 references

Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs

0 references

Q4234056

0 references

On the distributional complexity of disjointness

0 references

The communication complexity of addition

0 references

Q3002796

0 references

Identifiers

zbMATH Open document ID

1353.68088

0 references

1372.68113

0 references

DOI

10.1007/s00453-015-0093-8

0 references

10.1007/978-3-642-32512-0_39

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:343867

@@ Property / cites work @@
+A full proof of the BGW protocol for perfectly secure multiparty computation
+Normal rank
@@ Property / cites work @@
+How to compress interactive communication
@@ Property / cites work: How to compress interactive communication / rank @@
+Normal rank
@@ Property / cites work @@
+Information Equals Amortized Communication
@@ Property / cites work: Information Equals Amortized Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Interactive information complexity
@@ Property / cites work: Interactive information complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Privacy, additional information and communication
@@ Property / cites work: Privacy, additional information and communication / rank @@
+Normal rank
@@ Property / cites work @@
+An information statistics approach to data stream and communication complexity
+Normal rank
@@ Property / cites work @@
+A Zero-One Law for Boolean Privacy
@@ Property / cites work: A Zero-One Law for Boolean Privacy / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum and approximate privacy
@@ Property / cites work: Quantum and approximate privacy / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential Separation of Information and Communication for Boolean Functions
+Normal rank
@@ Property / cites work @@
+The Communication Complexity of Correlation
@@ Property / cites work: The Communication Complexity of Correlation / rank @@
+Normal rank
@@ Property / cites work @@
+Towards proving strong direct product theorems
@@ Property / cites work: Towards proving strong direct product theorems / rank @@
+Normal rank
@@ Property / cites work @@
+A strong direct product theorem for disjointness
@@ Property / cites work: A strong direct product theorem for disjointness / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
+Normal rank
@@ Property / cites work @@
+Q4234056
@@ Property / cites work: Q4234056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the distributional complexity of disjointness
@@ Property / cites work: On the distributional complexity of disjointness / rank @@
+Normal rank
@@ Property / cites work @@
+The communication complexity of addition
@@ Property / cites work: The communication complexity of addition / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002796
@@ Property / cites work: Q3002796 / rank @@
+Normal rank