194 citations · 1.9k across the 115 of their papers we have counts for
Showing 2013 · cs.CCShow all
2 papers · 2 filters
cs.CC2013
Weak Parity
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…
cs.CC2013★ 1 cited
New upper bound on block sensitivity and certificate complexity in terms of sensitivity
Andris Ambainis, Yihan Gao, Jieming Mao +2
Sensitivity \cite{CD82,CDR86} and block sensitivity \cite{Nisan91} are two important complexity measures of Boolean functions. A longstanding open problem in decision tree complexi…