Quadratically tight relations for randomized query complexity

DOI10.1007/978-3-319-90530-3_18MaRDI QIDQ6830263zbMATH OpenFDO

Authors Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgēnijs Vihrovs

Publication date 28 November 2018

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Classical models of computation (Turing machines, etc.) (68Q04)

This page was built for publication: Quadratically tight relations for randomized query complexity

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