2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
T.1: Complexity and Computation Theory | |
| Session Type: Lecture | |
| Track: Topics in Information Theory | |
| Virtual Session: View on Virtual Platform | |
| Session Chair: Pulkit Grover, Carnegie Mellon University | |
| T.1.1: On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard Codes | |
| Click here to download the manuscript | |
| Click here to view the Virtual Presentation | |
| Zhengrui Li; University of Science and Technology of China~(USTC) | |
| Sian-Jheng Lin; University of Science and Technology of China~(USTC) | |
| Yunghsiang S. Han; Dongguan University of Technology | |
| T.1.2: Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average | |
| Click here to download the manuscript | |
| Click here to view the Virtual Presentation | |
| David Gamarnik; MIT | |
| Eren C. Kizildag; MIT | |
| T.1.3: Interactive Verifiable Polynomial Evaluation | |
| Click here to download the manuscript | |
| Click here to view the Virtual Presentation | |
| Saeid Sahraei; Qualcomm Technologies, Inc. | |
| Mohammad Ali Maddah-Ali; Nokia Bell Labs | |
| Salman Avestimehr; University of Southern California | |
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
