The non-adaptive query complexity of testing k-parities

2013-01-01

Chicago Journal of Theoretical Computer Science Issue 6

Additional Metadata
THEME	Information (theme 2)
Stakeholder	Unspecified
Journal	Chicago Journal of Theoretical Computer Science
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. M. (2013). The non-adaptive query complexity of testing k-parities. Chicago Journal of Theoretical Computer Science, (6).

Publication