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