{"paper":{"title":"Improved pseudorandom generators from pseudorandom multi-switching lemmas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Li-Yang Tan, Rocco A. Servedio","submitted_at":"2018-01-10T23:58:03Z","abstract_excerpt":"We give the best known pseudorandom generators for two touchstone classes in unconditional derandomization: an $\\varepsilon$-PRG for the class of size-$M$ depth-$d$ $\\mathsf{AC}^0$ circuits with seed length $\\log(M)^{d+O(1)}\\cdot \\log(1/\\varepsilon)$, and an $\\varepsilon$-PRG for the class of $S$-sparse $\\mathbb{F}_2$ polynomials with seed length $2^{O(\\sqrt{\\log S})}\\cdot \\log(1/\\varepsilon)$. These results bring the state of the art for unconditional derandomization of these classes into sharp alignment with the state of the art for computational hardness for all parameter settings: improvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03590","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}