university website Publications by Year
  • sign in
  • Algorithms and Complexity /
  • Chicago Journal of Theoretical Computer Science /
  • Article
  • Search

H.M. Buhrman (Harry), D. Garcia Soriano (David), A. Matsliah (Arie) and R.M. de Wolf (Ronald)

2013

The non-adaptive query complexity of testing k-parities

Publication

Publication

Chicago Journal of Theoretical Computer Science Issue 6

Additional Metadata
THEME Information (theme 2)
Stakeholder Unspecified
Journal Chicago Journal of Theoretical Computer Science
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.M, 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).
  • View at arXiv

Free Full Text ( Author Manuscript , 156kb ) cover

university website
  • Address

    • Centrum Wiskunde & Informatica
    • Science Park 123 | 1098 XG Amsterdam
    • info@cwi.nl
  • Publishing at CWI

    • Open Access Portal
    • Submitting Your Work
  • Send article pdf, or link to archived materials:

    • artudis@cwi.nl
artudis website

Workflow

Workflow

Add Content


User Publication Person Organisation Collection
Close