Randomized versus deterministic decision tree size
A classic result of Nisan [SICOMP'91] states that the deterministic decision tree* depth*
complexity of every total Boolean function is at most the cube of its randomized decision …
complexity of every total Boolean function is at most the cube of its randomized decision …
Improved quantum query upper bounds based on classical decision trees
Given a classical query algorithm as a decision tree, when does there exist a quantum query
algorithm with a speed-up over the classical one? We provide a general construction based …
algorithm with a speed-up over the classical one? We provide a general construction based …
Exploring Size Complexity and Randomness in the Query Model [HBNI Th245]
Y Dahiya - 2024 - imsc.res.in
A central goal of computer science is to understand the capabilities and limitations of various
computational devices. To understand various computational devices we formalize them …
computational devices. To understand various computational devices we formalize them …