scientific article; zbMATH DE number 1306886
From MaRDI portal
Publication:4252738
zbMath0938.68921MaRDI QIDQ4252738
Publication date: 26 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (38)
Simulating Auxiliary Inputs, Revisited ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces ⋮ Improved hardness amplification in NP ⋮ Derandomized parallel repetition theorems for free games ⋮ The inverse Shapley value problem ⋮ Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy ⋮ Hardness amplification within NP against deterministic algorithms ⋮ Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? ⋮ A tight computational indistinguishability bound for product distributions ⋮ Query complexity in errorless hardness amplification ⋮ Pseudorandom generators, typically-correct derandomization, and circuit lower bounds ⋮ A note on the relation between XOR and selective XOR lemmas ⋮ Unnamed Item ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ A complete characterization of statistical query learning with applications to evolvability ⋮ Unnamed Item ⋮ Complexity of hard-core set proofs ⋮ A PCP Characterization of AM ⋮ Improved direct product theorems for randomized query complexity ⋮ Collapsing and separating completeness notions under average-case and worst-case hypotheses ⋮ The value of help bits in randomized and average-case complexity ⋮ Pseudorandom generators without the XOR lemma ⋮ Unnamed Item ⋮ Simulation theorems via pseudo-random properties ⋮ On derandomized composition of Boolean functions ⋮ Hardness amplification within NP ⋮ Pseudo-random generators for all hardnesses ⋮ Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification ⋮ Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification ⋮ Query Complexity in Errorless Hardness Amplification ⋮ On Yao’s XOR-Lemma ⋮ Computational Randomness from Generalized Hardcore Sets ⋮ Unnamed Item ⋮ Advice Lower Bounds for the Dense Model Theorem ⋮ A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Randomness vs time: Derandomization under a uniform assumption
This page was built for publication:
