تقرير
Structure in Communication Complexity and Constant-Cost Complexity Classes
| العنوان: | Structure in Communication Complexity and Constant-Cost Complexity Classes |
|---|---|
| المؤلفون: | Hatami, Hamed, Hatami, Pooya |
| سنة النشر: | 2024 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Computational Complexity |
| الوصف: | Several theorems and conjectures in communication complexity state or speculate that the complexity of a matrix in a given communication model is controlled by a related analytic or algebraic matrix parameter, e.g., rank, sign-rank, discrepancy, etc. The forward direction is typically easy as the structural implications of small complexity often imply a bound on some matrix parameter. The challenge lies in establishing the reverse direction, which requires understanding the structure of Boolean matrices for which a given matrix parameter is small or large. We will discuss several research directions that align with this overarching theme. Comment: This is a column to be published in the complexity theory column of SIGACT News |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2401.14623 |
| رقم الأكسشن: | edsarx.2401.14623 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |