Hardness magnification for all sparse NP languages

DOI10.1109/FOCS.2019.00077MaRDI QIDQ6944160zbMATH OpenFDO

Authors Ryan Williams, Ce Jin, Lijie Chen

Publication date 12 August 2025

Full work available at URL https://hdl.handle.net/1721.1/137492

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(5)

• On black-box meta complexity and function inversion
• On one-way functions, the worst-case hardness of time-bounded Kolmogorov complexity, and computational depth
• Learning algorithms from circuit lower bounds
• One-tape Turing machine and branching program lower bounds for MCSP
• An efficient coding theorem via probabilistic representations and its applications

This page was built for publication: Hardness magnification for all sparse NP languages

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