Quadratically Tight Relations for Randomized Query Complexity

In this work we investigate the problem of quadratically tightly approximating the randomized query complexity of Boolean functions R ( f ). The certificate complexity C ( f ) is such a complexity measure for the zero-error randomized query complexity R 0 ( f ): C ( f ) ≤ R 0 ( f ) ≤ C ( f ) 2 . In...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theory of computing systems Ročník 64; číslo 1; s. 101 - 119
Hlavní autori:	Jain, Rahul, Klauck, Hartmut, Kundu, Srijita, Lee, Troy, Santha, Miklos, Sanyal, Swagato, Vihrovs, Jevgēnijs
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2020 Springer Nature B.V Springer Verlag
Predmet:	Boolean algebra Boolean functions Communication Complexity Computational Complexity Computer Science Computer Science Symposium in Russia Error analysis Queries Randomization Theory of Computation Upper bounds Corruption bound Randomized algorithms Certificate complexity Query complexity Fractional block sensitivity
ISSN:	1432-4350, 1433-0490
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!