scientific article; zbMATH DE number 3145597

MaRDI QIDQ3262563zbMATH OpenFDO

Authors S. V. Yablonskij

Publication date 1959

zbMATH Keywords

numerical analysis

Cited in

(5)

• scientific article; zbMATH DE number 7300329 (Why is no real title available?)
• A direct PRF construction from Kolmogorov complexity
• Search-to-decision reductions for Kolmogorov complexity
• The non-uniform perebor conjecture for time-bounded Kolmogorov complexity is false
• On one-way functions, the worst-case hardness of time-bounded Kolmogorov complexity, and computational depth

This page was built for publication:

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