Imagen de Portada

Hypercontractivity on HDX II: Symmetrization and q-Norms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Hopkins, Max
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Combinatorics F.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Chernoff Bounds and Reverse Hypercontractivity on HDX
por: Dikstein, Yotam, et al.
Publicado: (2024)

High Rate Efficient Local List Decoding from HDX
por: Dikstein, Yotam, et al.
Publicado: (2026)

A Simple Sub-Polynomial Degree Coboundary Expander
por: Hopkins, Max, et al.
Publicado: (2026)

Small Shadow Partitions
por: Kopparty, Swastik, et al.
Publicado: (2024)

Battle Sheep is PSPACE-complete
por: Burke, Kyle, et al.
Publicado: (2025)

On Minimum Maximal Distance-k Matchings
por: Kartynnik, Yury, et al.
Publicado: (2016)

An Optimal Randomized Algorithm for Finding the Saddlepoint
por: Dallant, Justin, et al.
Publicado: (2024)

On Sampling Lower Bounds for Polynomials
por: Khodabandeh, Mohammad Mahdi, et al.
Publicado: (2026)

A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers
por: Burke, Kyle, et al.
Publicado: (2024)

Formula Size-Depth Tradeoffs for Iterated Sub-Permutation Matrix Multiplication
por: Rossman, Benjamin
Publicado: (2024)

Induced Disjoint Paths Without an Induced Minor
por: Aboulker, Pierre, et al.
Publicado: (2025)

Symmetric-Difference (Degeneracy) and Signed Tree Models
por: Bonnet, Édouard, et al.
Publicado: (2024)

Col is PSPACE-complete on Triangular Grids
por: Burke, Kyle, et al.
Publicado: (2025)

An SoS Entropy Dichotomy via Windowed Hypercontractivity
por: Lela, Marko
Publicado: (2025)

Evolomino is NP-complete
por: Nikolaev, Andrei V.
Publicado: (2025)

The Word Problem for Products of Symmetric Groups
por: Simon, Hans U.
Publicado: (2025)

Explicit separations between randomized and deterministic Number-on-Forehead communication
por: Kelley, Zander, et al.
Publicado: (2023)

The Banach-Butterfly Invariant: Influence-Adaptive Walsh Geometry for Ternary Polynomial Threshold Functions
por: Pavlov, Gorgi
Publicado: (2026)

Pseudorandomness of the Sticky Random Walk
por: Anand, Emile, et al.
Publicado: (2023)

Replicability in High Dimensional Statistics
por: Hopkins, Max, et al.
Publicado: (2024)

Symmetric Arithmetic Circuits
por: Dawar, Anuj, et al.
Publicado: (2020)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
por: Bougeret, Marin, et al.
Publicado: (2024)

Kernelization dichotomies for hitting minors under structural parameterizations
por: Bougeret, Marin, et al.
Publicado: (2025)

Quasi-Linear Size PCPs with Small Soundness from HDX
por: Bafna, Mitali, et al.
Publicado: (2024)

Treewidth Inapproximability and Tight ETH Lower Bound
por: Bonnet, Édouard
Publicado: (2024)

Mim-Width is paraNP-complete
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Answering Related Questions
por: Bonnet, Édouard
Publicado: (2025)

Rankwidth of Graphs with Balanced Separations: Expansion for Dense Graphs
por: Anand, Emile
Publicado: (2025)

Coloring Hardness on Low Twin-Width Graphs
por: Bonnet, Édouard
Publicado: (2025)

Lower Bounds for Symmetric Circuits for the Determinant
por: Dawar, Anuj, et al.
Publicado: (2021)

The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
por: Nowotka, Dirk, et al.
Publicado: (2024)

The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
por: Nowotka, Dirk, et al.
Publicado: (2024)

Structure-Guided Automated Reasoning
por: Bannach, Max, et al.
Publicado: (2023)

A universal bound on the space complexity of Directed Acyclic Graph computations
por: Bilardi, Gianfranco, et al.
Publicado: (2024)

Fast Simulation of Cellular Automata by Self-Composition
por: Natal, Joseph, et al.
Publicado: (2024)

A Polynomial Time Algorithm for 3SAT
por: Quigley, Robert
Publicado: (2024)

NP-Completeness Proofs of Puzzles using the T-Metacell Framework
por: Kiatchaipipat, Nattapol, et al.
Publicado: (2025)

When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?
por: Fritsch, Timo, et al.
Publicado: (2026)

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
por: Gupta, Chetan, et al.
Publicado: (2025)

Direct Sums for Parity Decision Trees
por: Besselman, Tyler, et al.
Publicado: (2024)