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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+A Discrepancy Lower Bound for Information Complexity
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6101564
@@ Property / title @@
+A Discrepancy Lower Bound for Information Complexity (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68113
@@ Property / zbMATH Open document ID: 1372.68113 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-32512-0_39
@@ Property / DOI: 10.1007/978-3-642-32512-0_39 / rank @@
+Normal rank
@@ Property / published in @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / publication date @@
+November 2012Timestamp +2012-11-02T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2012-11-02T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 2 November 2012 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+P30
@@ Property / Mathematics Subject Classification ID: 68P30 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q05
@@ Property / Mathematics Subject Classification ID: 68Q05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6101564
@@ Property / zbMATH DE Number: 6101564 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2113315930
@@ Property / OpenAlex ID: W2113315930 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2496614101
@@ Property / OpenAlex ID: W2496614101 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2000
@@ Property / arXiv ID: 1112.2000 / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:343867

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