By Topic

Towards proving strong direct product theorems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Shaltiel, R. ; Hebrew Univ., Jerusalem, Israel

A fundamental question of complexity theory is the direct product question. A famous example is Yao's (1982) XOR-lemma, in which one assumes that some function f is hard on average for small circuits, (meaning that every circuit of some fixed size s which attempts to compute f is wrong on a non-negligible fraction of the inputs) and concludes that every circuit of size s' has a small advantage over guessing randomly when computing f⊕k (x1, …, xk)=f(x1)⊕…⊕f(xk ) on independently chosen x1, …, xk. All known proofs of this lemma have the feature that s'<s. In words, the circuit which attempts to compute f⊕k is smaller than the circuit which attempts to compute f on a single input. This paper addresses the issue of proving strong direct product assertions, that is ones in which s'≈ks and is in particular larger than s. Since we are unable to “handle” boolean circuits we follow a direction suggested by previous works (Nisan et al., 1994; Parnafes et al., 1997) and study this question in weaker computational models such as decision trees and communication complexity games

Published in:

Computational Complexity, 16th Annual IEEE Conference on, 2001.

Date of Conference:

2001