scientific article; zbMATH DE number 7515768

zbMath1484.68070MaRDI QIDQ5072483

Shuichi Hirahara

Publication date: 28 April 2022

Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/688/722

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Capturing one-way functions via NP-hardness of meta-complexity ⋮ A duality between one-way functions and average-case symmetry of information

This page was built for publication: