On defining PPT-search problems

DOI10.1007/978-3-031-88946-2_1MaRDI QIDQ6877287zbMATH OpenFDO

Authors Oded Goldreich

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-88946-2_1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Cites work

• Computational Complexity
• In a world of \(\mathrm{P}=\mathrm{BPP}\)
• The complexity of promise problems with applications to public-key cryptography

Cited in

(1)

• Multi-pseudodeterministic algorithms

This page was built for publication: On defining PPT-search problems

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