Communication complexity of permutation-invariant functions
Thesis: S.M. in Computer Science & Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Main Author: | Kamath, Pritish |
---|---|
Other Authors: | Madhu Sudan. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2015
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/99861 |
Similar Items
-
Some hardness escalation results in computational complexity theory
by: Kamath, Pritish.
Published: (2020) -
Security of substitution-permutation network
by: Chen, Cheng, S.M. Massachusetts Institute of Technology
Published: (2016) -
Generalizations of permutation source codes
by: Nguyen, Ha Quy
Published: (2010) -
Few-shot action recognition with permutation-invariant attention
by: Zhang, H, et al.
Published: (2020) -
Query-to-Communication Lifting for PNP
by: Göös, Mika, et al.
Published: (2021)