Impossibility Results on Weakly Black-Box Hardness Amplification

DOI10.1007/978-3-540-74240-1_35zbMath1135.68432OpenAlexW1528583527MaRDI QIDQ5444979

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

Publication date: 26 February 2008

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_35

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Incompressible functions, relative-error extractors, and the power of nondeterministic reductions

This page was built for publication: Impossibility Results on Weakly Black-Box Hardness Amplification