1.1k citations · 4.7k across the 73 of their papers we have counts for
1 paper · 2 filters
Ashley Montanaro
We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f^1,...,f^n), where each relation f^i is boolean-valued. Imm…