Pages that link to "Item:Q5917576"

The following pages link to Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576):

Displaying 20 items.

• Certifying equality with limited interaction (Q343864) (← links)
• Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
• On matrix rigidity and locally self-correctable codes (Q645122) (← links)
• Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
• Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
• On coset leader graphs of structured linear codes (Q1985294) (← links)
• Quantum private information retrieval has linear communication complexity (Q2018821) (← links)
• Evolutionary algorithms for quantum computers (Q2441596) (← links)
• Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
• SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY (Q2879416) (← links)
• Outlaw distributions and locally decodable codes (Q4638069) (← links)
• High-entropy dual functions over finite fields and locally decodable codes (Q4965879) (← links)
• On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
• Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
• Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5090407) (← links)
• Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
• High-rate codes with sublinear-time decoding (Q5501932) (← links)
• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
• On the threshold for Szemerédi's theorem with random differences (Q6635163) (← links)