Image de couverture de livre

The Lens of Abelian Embeddings

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Minzer, Dor
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Constant Degree Direct Product Testers with Small Soundness
par: Bafna, Mitali, et autres
Publié: (2024)

On Approximability of Satisfiable k-CSPs: IV
par: Bhangale, Amey, et autres
Publié: (2023)

An Invariance Principle for the Multi-slice, with Applications
par: Braverman, Mark, et autres
Publié: (2021)

On Approximability of Satisfiable $k$-CSPs: VI
par: Bhangale, Amey, et autres
Publié: (2024)

On Approximability of Satisfiable $k$-CSPs: VII
par: Bhangale, Amey, et autres
Publié: (2024)

Reasonable Bounds for Combinatorial Lines of Length Three
par: Bhangale, Amey, et autres
Publié: (2024)

A Distance Amplification Lemma for Monotonicity
par: Minzer, Dor
Publié: (2025)

Characterizing Direct Product Testing via Coboundary Expansion
par: Bafna, Mitali, et autres
Publié: (2023)

Near Optimal Hardness of Approximating $k$-CSP
par: Minzer, Dor, et autres
Publié: (2025)

On Approximability of Satisfiable k-CSPs: V
par: Bhangale, Amey, et autres
Publié: (2024)

Quasi-Linear Size PCPs with Small Soundness from HDX
par: Bafna, Mitali, et autres
Publié: (2024)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes
par: Minzer, Dor, et autres
Publié: (2025)

Near Optimal Alphabet-Soundness Tradeoff PCPs
par: Minzer, Dor, et autres
Publié: (2024)

Near-Optimal Space Lower Bounds for Streaming CSPs
par: Fei, Yumou, et autres
Publié: (2026)

A Dichotomy Theorem for Multi-Pass Streaming CSPs
par: Fei, Yumou, et autres
Publié: (2025)

3-Query RLDCs are Strictly Stronger than 3-Query LDCs
par: Gur, Tom, et autres
Publié: (2025)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
par: Fei, Yumou, et autres
Publié: (2025)

Product Mixing in Compact Lie Groups
par: Ellis, David, et autres
Publié: (2024)

An Analytical Approach to Parallel Repetition via CSP Inverse Theorems
par: Bhangale, Amey, et autres
Publié: (2025)

Parallel Repetition for $3$-Player XOR Games
par: Bhangale, Amey, et autres
Publié: (2024)

A Note on the Complexity of Directed Clique
par: Gutowski, Grzegorz, et autres
Publié: (2026)

Lions and Contamination: Trees and General Graphs
par: Kim, Dohoon, et autres
Publié: (2026)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
par: Grüne, Christoph, et autres
Publié: (2026)

A Hypergraph Container Method on Spread SAT: Approximation and Speedup
par: Han, Zicheng, et autres
Publié: (2026)

Classification of Non-redundancy of Boolean Predicates of Arity 4
par: Brakensiek, Joshua, et autres
Publié: (2026)

King Chasing Problem in Chinese Chess is NP-hard
par: Li, Chao, et autres
Publié: (2026)

Between proper and square coloring of planar graphs, hardness and extremal graphs
par: Delépine, Thomas
Publié: (2026)

Communication Complexity of Disjointness under Product Distributions
par: Hunter, Zach, et autres
Publié: (2026)

Low-Degree Polynomials Are Good Extractors
par: Alrabiah, Omar, et autres
Publié: (2024)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
par: Eagling-Vose, Tala, et autres
Publié: (2025)

Refuting Perfect Matchings in Spectral Expanders is Hard
par: Biswas, Ari, et autres
Publié: (2025)

Direct Product Primality Testing of Graphs is GI-hard
par: Calderoni, Luca, et autres
Publié: (2020)

Monotone Circuit Complexity of Matching
par: Cavalar, Bruno, et autres
Publié: (2025)

Hunting a rabbit: complexity, approximability and some characterizations
par: Ben-Ameur, Walid, et autres
Publié: (2025)

On the Keevash-Knox-Mycroft Conjecture
par: Gan, Luyining, et autres
Publié: (2022)

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
par: Borzechowski, Michaela, et autres
Publié: (2023)

Sparse juntas on the biased hypercube
par: Dinur, Irit, et autres
Publié: (2017)

Improved Lower Bounds for all Odd-Query Locally Decodable Codes
par: Basu, Arpon, et autres
Publié: (2024)

Flat origami is Turing Complete
par: Hull, Thomas C., et autres
Publié: (2023)

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
par: Hsieh, Jun-Ting, et autres
Publié: (2024)