Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2004.04.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4230909286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound on the communication complexity of private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are bitvectors optimal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for adaptive locally decodable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Self-Reducibility of Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly resilient correctors for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linking classical and quantum key agreement: Is there a classical analog to bound entanglement? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for linear locally decodable codes and private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of local decoding procedures for error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bound for 2-query locally decodable codes via a quantum argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction in quantum communication and the complexity of set disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators without the XOR Lemma (extended abstract) / rank
 
Normal rank

Revision as of 14:19, 7 June 2024

scientific article; zbMATH DE number 2116229
Language Label Description Also known as
English
Exponential lower bound for 2-query locally decodable codes via a quantum argument
scientific article; zbMATH DE number 2116229

    Statements

    Exponential lower bound for 2-query locally decodable codes via a quantum argument (English)
    0 references
    0 references
    0 references
    18 November 2004
    0 references
    Quantum computing
    0 references
    Locally decodable codes
    0 references
    Private information retrieval
    0 references

    Identifiers