Towards proving strong direct product theorems

R. Shaltiel

Towards proving strong direct product theorems

R. Shaltiel

Research output: Contribution to journal › Conference article › peer-review

Abstract

The issue of proving strong direct product assertions, that is ones in which s' ≈ ks and is in particular larger than s, is addressed. This question is studied in weaker computational models such as decision trees and communication complexity games. Results obtained can be extended to stronger computational models.

Original language	English
Pages (from-to)	107-117
Number of pages	11
Journal	Proceedings of the Annual IEEE Conference on Computational Complexity
State	Published - 2001
Externally published	Yes
Event	16th Annual IEEE Conference on Computational Complexity - Chicago, IL, United States Duration: 18 Jun 2001 → 21 Jun 2001

ASJC Scopus subject areas

Software
Theoretical Computer Science
Computational Mathematics

Cite this

@article{51e4baf109684f6dba66ddb4b2248264,

title = "Towards proving strong direct product theorems",

abstract = "The issue of proving strong direct product assertions, that is ones in which s' ≈ ks and is in particular larger than s, is addressed. This question is studied in weaker computational models such as decision trees and communication complexity games. Results obtained can be extended to stronger computational models.",

author = "R. Shaltiel",

year = "2001",

language = "English",

pages = "107--117",

journal = "Proceedings of the Annual IEEE Conference on Computational Complexity",

issn = "1093-0159",

publisher = "IEEE Computer Society",

note = "16th Annual IEEE Conference on Computational Complexity ; Conference date: 18-06-2001 Through 21-06-2001",

}

TY - JOUR

T1 - Towards proving strong direct product theorems

AU - Shaltiel, R.

PY - 2001

Y1 - 2001

N2 - The issue of proving strong direct product assertions, that is ones in which s' ≈ ks and is in particular larger than s, is addressed. This question is studied in weaker computational models such as decision trees and communication complexity games. Results obtained can be extended to stronger computational models.

AB - The issue of proving strong direct product assertions, that is ones in which s' ≈ ks and is in particular larger than s, is addressed. This question is studied in weaker computational models such as decision trees and communication complexity games. Results obtained can be extended to stronger computational models.

UR - https://www.scopus.com/pages/publications/0034869781

M3 - Conference article

AN - SCOPUS:0034869781

SN - 1093-0159

SP - 107

EP - 117

JO - Proceedings of the Annual IEEE Conference on Computational Complexity

JF - Proceedings of the Annual IEEE Conference on Computational Complexity

T2 - 16th Annual IEEE Conference on Computational Complexity

Y2 - 18 June 2001 through 21 June 2001

ER -

Towards proving strong direct product theorems

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this