Fetching the paper…
Reading the bibliography…
An XOR function is a function of the form g(x,y) = f(x + y), for some boolean function f on n bits.
Some complexity questions related to distributive computing
A. Yao · 1979
Earlier work this paper cites.
Las Vegas is better than determinism in VLSI and distributed computing
K. Mehlhorn and E. Schmidt · 1982
Earlier work this paper cites.
Learning decision trees using the Fourier spectrum
E. Kushilevitz and Y. Mansour · 1991
Earlier work this paper cites.
Slicing the hypercube
M. Saks · 1993
Earlier work this paper cites.
Quantum circuit complexity
A. Yao · 1993
Earlier work this paper cites.
Quantum communication
I. Kremer · 1995
Earlier work this paper cites.
On the power of circuits with gates of low L1 norm
V. Grolmusz · 1997
Earlier work this paper cites.
Communication Complexity
E. Kushilevitz and N. Nisan · 1997
Earlier work this paper cites.
Quantum information theory
M. A. Nielsen · 1998
Earlier work this paper cites.
Spectral analysis of Boolean functions as a graph eigenvalue problem
A. Bernasconi and B. Codenotti · 1999
Earlier work this paper cites.
On randomized one-round communication complexity
I. Kremer, N. Nisan, and D. Ron · 1999
Cited alongside, same era.
Exponential separation of quantum and classical communication complexity
R. Raz · 1999
Cited alongside, same era.
On quantum and probabilistic communication: Las Vegas and one-way protocols
H. Klauck · 2000
Cited alongside, same era.
Communication complexity lower bounds by polynomials
H. Buhrman and R. de Wolf · 2001
Cited alongside, same era.
Lower bounds for quantum communication complexity
H. Klauck · 2001
Cited alongside, same era.
Complexity measures and decision tree complexity: a survey
H. Buhrman and R. de Wolf · 2002
Cited alongside, same era.
The communication complexity of the Hamming distance problem
W. Huang, Y. Shi, S. Zhang, and Y. Zhu · 2006
Later among the works it cites.
Exponential separations for one-way quantum communication complexity, with applications to cryptography
D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf · 2007
Later among the works it cites.
Lower bounds for quantum communication complexity
H. Klauck · 2007
Later among the works it cites.
15-859S: Analysis of boolean functions, 2007
R. O’Donnell · 2007
Later among the works it cites.
The pattern matrix method for lower bounds on quantum communication
A. Sherstov · 2008
Later among the works it cites.
Quantum communication complexity of block-composed functions, 2008
Y. Shi and Y. Zhu · 2008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. de Wolf · 2002
Cited alongside, same era.
Quantum communication complexity of symmetric predicates
A. A. Razborov · 2003
Cited alongside, same era.
On the power of quantum fingerprinting
A. Yao · 2003
Cited alongside, same era.
Quantum communication cannot simulate a public coin, 2004
D. Gavinsky, J. Kempe, and R. de Wolf · 2004
Cited alongside, same era.
Later among the works it cites.
A brief introduction to Fourier analysis on the boolean cube
R. de Wolf · 2008
Later among the works it cites.
Testing Fourier dimensionality and sparsity
P. Gopalan, R. O’Donnell, R. A. Servedio, A. Shpilka, and K. Wimmer · 2009
Closest in time.
On quantum-classical equivalence for composed communication problems, 2009
A. Sherstov · 2009
Closest in time.
Communication complexities of symmetric XOR functions
Y. Shi and Z. Zhang · 2009
Closest in time.