Publication

A Majority Lemma for Randomised Query Complexity

Mika Tapani Göös, Gilbert Théodore Maystre
2021
Conference Papers

Abstract

We show that computing the majority of n copies of a boolean function g has randomised query complexity R(Maj∘gⁿ) = Θ(n⋅R ̅_{1/n}(g)). In fact, we show that to obtain a similar result for any composed function f∘gⁿ, it suffices to prove a sufficiently strong form of the result only in the special case g = GapOr. LIPIcs, Vol. 200, 36th Computational Complexity Conference (CCC 2021), pages 18:1-18:15

Official source

https://infoscience.epfl.ch/entities/publication/cc9e7e2d-37d5-4f3c-b552-c0c7778c109c

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Majority Lemma for Randomised Query Complexity

Chat with Graph Search

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Additive and geometric transversality of fractal sets in the integers

Improving Standard-Cell Design Flow using Factored Form Optimization