The non-adaptive query complexity of testing k-parities

Additional Metadata
THEME	Life Sciences (theme 5), Logistics (theme 3)
Publisher	Cornell University Library
Series	arXiv.org e-Print archive
Project	Quantum Computing: algorithms, proofs and tradeoffs , Quantum computing: fault-tolerance, communication, and classical spin-offs
Note	preprint
Organisation	Algorithms and Complexity
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	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 .

Publication