Journal of the ACM (JACM): Volume 64 Issue 5, October 2017
Citation Count: 0
Downloads (6 Weeks): 12, Downloads (12 Months): 102, Downloads (Overall): 102
Full text available:
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total Boolean function is given by the function f on n = 2 k bits defined by a complete binary tree of NAND gates of depth k , which achieves R ...
query complexity, Decision trees, quantum algorithms
STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
Citation Count: 2
Downloads (6 Weeks): 3, Downloads (12 Months): 48, Downloads (Overall): 115
Full text available:
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function f on n =2 k bits defined by a complete binary tree of NAND gates of depth k , which achieves R 0 ...
Monte Carlo, Randomized algorithms, Deterministic algorithms, Las Vegas, Quantum algorithms
FCT'13: Proceedings of the 19th international conference on Fundamentals of Computation Theory
We show a family of languages that can be recognized by a family of linear-size alternating one-way finite automata with one alternation but cannot be recognized by any family of polynomial-size bounded-error two-way probabilistic finite automata with the expected runtime bounded by a polynomial. In terms of finite automata complexity ...
ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n , the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... ...
MEMICS'11: Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Prediction of functions is one of processes considered in inductive inference. There is a "black box" with a given total function f in it. The result of the inductive inference machine F(<f(0), f(1),⋯,f(n)>) is expected to be f(n+1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation ...