,
Cornell University Library
arXiv.org e-Print archive
Quantum Computing: algorithms, proofs and tradeoffs , Quantum computing: fault-tolerance, communication, and classical spin-offs
Algorithms and Complexity

Buhrman, H., Garcia Soriano, D., Matsliah, A., & de Wolf, R. (2012). The non-adaptive query complexity of testing k-parities. arXiv.org e-Print archive. Cornell University Library .