A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract

We prove two new results about the randomized query complexity of composed functions. First, we show that the randomized composition conjecture is false: there are families of partial Boolean functions f and g such that \mathrm{R}(f\circ g)\ll \mathrm{R}(f)\mathrm{R}(g) . In fact, we show that the l...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 240 - 246
Hlavní autori:	Ben-David, Shalev, Blais, Eric
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2020
Predmet:	Boolean functions Complexity theory Computer science Function composition Gap Majority function Loss measurement Noise measurement Noisy oracle Query complexity Randomized computation Sensitivity Upper bound
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!