Pages that link to "Item:Q2819586"
From MaRDI portal
The following pages link to Pseudorandom generators without the XOR Lemma (extended abstract) (Q2819586):
Displaying 11 items.
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Constructing near spanning trees with few local inspections (Q2977565) (← links)
- Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
- Some Recent Results on Local Testing of Sparse Linear Codes (Q4933384) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Lower bounds for adaptive locally decodable codes (Q5704840) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
