Query Complexity

DOI10.1142/10525MaRDI QIDQ5218478zbMATH OpenOpenAlexFDO

Authors Ilan Newman, Troy Lee, Mario Szegedy

Publication date 4 March 2020

Full work available at URL https://doi.org/10.1142/10525

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Randomized algorithms (68W20)

This page was built for publication: Query Complexity

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