Ronald de Wolf coauthored Complexity Measures and Decision Tree Complexity: A Survey by Harry Buhrman and Ronald de Wolf. Its subject is the relationship between ways of measuring a Boolean function's computational difficulty, particularly query and certificate measures and their quantum counterparts.[ref]
Ronald de Wolf is a prominent computer scientist known for his work in quantum computing and quantum information theory. He is particularly noted for his research on quantum algorithms and their implications for computational complexity. De Wolf has contributed to understanding the power of quantum computers compared to classical computers, including work on specific quantum algorithms and their efficiency.
New to topics? Read the docs here!