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...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 64; no. 1; pp. 101 - 119
Main Authors:	Jain, Rahul, Klauck, Hartmut, Kundu, Srijita, Lee, Troy, Santha, Miklos, Sanyal, Swagato, Vihrovs, Jevgēnijs
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2020 Springer Nature B.V Springer Verlag
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!