Communication is Bounded by Root of Rank (Q3177758): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Communication is bounded by root of rank
description / endescription / en
scientific article
scientific article; zbMATH DE number 6451614
Property / title
 
Communication is bounded by root of rank (English)
Property / title: Communication is bounded by root of rank (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1315.68155 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/2591796.2591799 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing / rank
 
Normal rank
Property / publication date
 
26 June 2015
Timestamp+2015-06-26T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 26 June 2015 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6451614 / rank
 
Normal rank
Property / zbMATH Keywords
 
communication complexity
Property / zbMATH Keywords: communication complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
log rank conjecture
Property / zbMATH Keywords: log rank conjecture / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2282727044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027115070 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1306.1877 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SuLQ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Sample Complexity for Private Learning and Private Data Release / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the sample complexity of private learners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private Learning and Sanitization: Pure vs. Approximate Differential Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collusion-secure fingerprinting for digital data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster private release of marginals on small databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds in Differential Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Our Data, Ourselves: Privacy Via Distributed Noise Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of differentially private data release / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for privately releasing marginals via convex relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Efficient Attacks on Statistical Disclosure Control Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privately Releasing Conjunctions and the Statistical Query Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Constructions and Private Data Release / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of differential privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of privately releasing contingency tables and the spectra of random matrices with correlated rows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Differential Privacy: The Small Database and Approximate Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Privacy and the Fat-Shattering Dimension of Linear Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive privacy via the median mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Privately Releasing Marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answering n <sub>{2+o(1)}</sub> counting queries with differential privacy is hard / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:47, 10 July 2024

scientific article; zbMATH DE number 6451614
  • Communication is bounded by root of rank
Language Label Description Also known as
English
Communication is Bounded by Root of Rank
scientific article; zbMATH DE number 6451614
  • Communication is bounded by root of rank

Statements

Communication is Bounded by Root of Rank (English)
0 references
Communication is bounded by root of rank (English)
0 references
0 references
2 August 2018
0 references
26 June 2015
0 references
log-rank conjecture
0 references
communication complexity
0 references
log rank conjecture
0 references
0 references
0 references
0 references

Identifiers

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