6 citations · 6 across the 3 of their papers we have counts for
1 paper · 2 filters
Scott Aaronson, Andris Ambainis, Kaspars Balodis +1
We study the query complexity of Weak Parity: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+eps fraction of input strings, bu…