On the Complexity of Hardness Amplification

DOI10.1109/TIT.2008.928988MaRDI QIDQ3604852zbMATH OpenOpenAlexFDO

Authors Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2008.928988

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Theory of Cryptography
• Impossibility Results on Weakly Black-Box Hardness Amplification
• Using Nondeterminism to Amplify Hardness
• Using nondeterminism to amplify hardness
• Hardness Amplification Proofs Require Majority

Cited in

(20)

• The complexity of constructing pseudorandom generators from hard functions
• Advice lower bounds for the dense model theorem
• Counterexamples to hardness amplification beyond negligible
• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
• Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
• Query complexity in errorless hardness amplification
• Limitations of Hardness vs. Randomness under Uniform Reductions
• Using nondeterminism to amplify hardness
• On uniform amplification of hardness in NP
• Complexity of hard-core set proofs
• Hardness Amplification Proofs Require Majority
• On the Complexity of Hard-Core Set Constructions
• Impossibility Results on Weakly Black-Box Hardness Amplification
• Using Nondeterminism to Amplify Hardness
• Theory of Cryptography
• scientific article; zbMATH DE number 7758312 (Why is no real title available?)
• Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?
• Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification
• Improved hardness amplification in NP
• Query complexity in errorless hardness amplification

This page was built for publication: On the Complexity of Hardness Amplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604852)