The classical communication complexity of testing closeness of discrete
...
The negative weight adversary method, ADV^±(g), is known to
characterize...
We establish new upper and lower bounds on the number of queries require...
In the property testing model, the task is to distinguish objects posses...
In this paper, we study quantum query complexity of the following rather...
In this paper, we prove a polynomial lower bound of Ω(n^1/3) on the
quan...
The complexity class PPA consists of NP-search problems which are reduci...