scientific article; zbMATH DE number 7789149

DOI10.4086/TOC.2023.V019A009MaRDI QIDQ6138069OpenAlexFDO

Authors Troy Lee, Miklos Santha, Swagato Sanyal

Publication date 16 January 2024

Published in Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4086/toc.2023.v019a009

zbMATH Keywords

lower boundquery complexitycomposed functionrandomized decision tree

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of computing (68Qxx)

Cites work

• Properties and applications of Boolean function composition

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 Q6138069)