Pages that link to "Item:Q5943089"

The following pages link to Pseudorandom generators without the XOR lemma (Q5943089):

Displaying 50 items.

• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
• Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
• The inverse conjecture for the Gowers norm over finite fields in low characteristic (Q434231) (← links)
• Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
• Complexity of hard-core set proofs (Q451110) (← links)
• Symmetric LDPC codes and local testing (Q519972) (← links)
• On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
• Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
• Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
• Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
• Improved hardness amplification in NP (Q868960) (← links)
• Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
• On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
• Local algorithms for sparse spanning graphs (Q2300722) (← links)
• Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
• Reconstructive dispersers and hitting set generators (Q2391190) (← links)
• Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
• List-decoding Barnes-Wall lattices (Q2410678) (← links)
• On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
• ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS (Q3084685) (← links)
• Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
• Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
• Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
• Local Property Reconstruction and Monotonicity (Q4933387) (← links)
• Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
• (Q5002654) (← links)
• (Q5028363) (← links)
• Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
• (Q5090443) (← links)
• Typically-correct derandomization for small time and space (Q5091759) (← links)
• (Q5092470) (← links)
• Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
• Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
• Amplification and Derandomization without Slowdown (Q5129234) (← links)
• Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
• A combination of testability and decodability by tensor products (Q5252263) (← links)
• Direct Sum Testing (Q5348457) (← links)
• (Q5875496) (← links)
• (Q5875528) (← links)
• Hardness amplification within NP (Q5917544) (← links)
• Pseudo-random generators for all hardnesses (Q5917585) (← links)
• Erasures versus errors in local decoding and property testing (Q6074671) (← links)
• (Q6084353) (← links)
• (Q6084358) (← links)
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)
• Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
• Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)