Hatami, Pooya

1. Every locally characterized affine-invariant property is testable
   2012/12/16 by Arnab Bhattacharyya, Bhattacharyya, Arnab, Eldar Fischer +7 · 2 citations
   Computer Science · #Coding theory and cryptography #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Polynomial and algebraic computation
2. An Asymptotically Tight Bound on the Number of Relevant Variables in a\n Bounded Degree Boolean Function
   2018/01/25 by John Chiarelli, Chiarelli, John, Pooya Hatami +3 · 1 citation
   Computer Science · Mathematics · #Combinatorics (math.CO) #Commutative Algebra and Its Applications #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning and Algorithms
3. No Complete Problem for Constant-Cost Randomized Communication
   2024/03/31 by Fang, Yuting, Hambardzumyan, Lianna, Harms, Nathaniel +1 · 3 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
4. Structure in Communication Complexity and Constant-Cost Complexity Classes
   2024/01/26 by Hamed Hatami, Hatami, Hamed, Pooya Hatami +1 · 2 citations
   Computer Science · Engineering · #Coding theory and cryptography #Quantum Computing Algorithms and Architecture #cs.CC #graph theory and CDMA systems
5. Online Learning and Disambiguations of Partial Concept Classes
   2023/03/30 by Cheung, Tsun-Ming, Hatami, Hamed, Hatami, Pooya +1 · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Machine Learning (cs.LG)
6. Constant-Cost Communication is not Reducible to k-Hamming Distance
   2024/07/29 by Fang, Yuting, Göös, Mika, Harms, Nathaniel +1 · 2 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
7. An Arithmetic Analogue of Fox's Triangle Removal Argument
   2013/04/17 by Pooya Hatami, Sushant Sachdeva, Hatami, Pooya +3 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory
8. Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces
   2025/03/19 by Blondal, Ari, Hatami, Hamed, Hatami, Pooya +2 · 2 citations
   #FOS: Computer and information sciences #Machine Learning (cs.LG)