Query complexity of search problems

DOI10.4230/LIPICS.MFCS.2023.34MaRDI QIDQ6647662zbMATH OpenFDO

Authors Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan

Publication date 3 December 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2023.34

zbMATH Keywords

decision treespseudo-determinismrandomnesssearch problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Unambiguous parity-query complexity
• Polynomial-time pseudodeterministic construction of primes

This page was built for publication: Query complexity of search problems

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