Improved direct product theorems for randomized query complexity

The “direct product problem” is a fundamental question in complexity theory which seeks to understand how the difficulty in computing a function on each of k independent inputs scales with k . We prove the following direct product theorem (DPT) for query complexity: if every T -query algorithm has s...

Full description

Bibliographic Details

Published in:	Computational complexity Vol. 21; no. 2; pp. 197 - 244
Main Author:	Drucker, Andrew
Format:	Journal Article
Language:	English
Published:	Basel SP Birkhäuser Verlag Basel 01.06.2012
Subjects:	Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science average-case complexity hardness amplification 68Q17 Direct product theorems query complexity decision trees
ISSN:	1016-3328, 1420-8954
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!