Research articles

search articles

My Pages

Stat

Members: 3645
Articles: 2'501'711
Articles rated: 2609

19 April 2024

» arxiv » 1209.3849

Article overview

The non-adaptive query complexity of testing k-parities
Harry Buhrman ; David Garcia-Soriano ; Arie Matsliah ; Ronald de Wolf ;
Date:	18 Sep 2012
Abstract:	We prove tight bounds of Theta(k log k) queries for non-adaptively testing whether a function f:{0,1}^n -> {0,1} is a k-parity or far from any k-parity. Both upper and lower bounds are new. The lower bound combines a recent method of Blais, Brody and Matulef [BBM11] to get testing lower bounds from communication complexity, with a new Theta(k log k) bound for the one-way communication complexity of k-disjointness.
Source:	arXiv, 1209.3849
Services:	Forum \| Review \| PDF \| Favorites

No review found.

Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)

ScienXe.org
» my Online CV
» Free

News, job offers and information for researchers and scientists:

home

contact

sitemap