scientific article; zbMATH DE number 7140489

DOI10.4086/toc.2019.v015a012zbMath1477.94080OpenAlexW3132630448MaRDI QIDQ5204830

Sivakanth Gopi, Zeev Dvir, Jop Briët

Publication date: 5 December 2019

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2019.v015a012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Boolean functionshypergraphsinfluenceincidence geometrypseudorandomnesslocally decodable codesGaussian width

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Decoding (94B35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Subspaces of tensors with high analytic rank ⋮ High-entropy dual functions over finite fields and locally decodable codes

This page was built for publication: