A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:23, 9 February 2024
scientific article; zbMATH DE number 5242868
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval |
scientific article; zbMATH DE number 5242868 |
Statements
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (English)
0 references
5 March 2008
0 references
