Imagen de Portada

Boosting uniformity in quasirandom groups: fast and simple

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Derksen, Harm, Lee, Chin Ho, Viola, Emanuele
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Pseudorandomness, symmetry, smoothing: I
por: Derksen, Harm, et al.
Publicado: (2024)

Pseudorandomness, symmetry, smoothing: II
por: Derksen, Harm, et al.
Publicado: (2024)

Pseudorandom bits for non-commutative programs
por: Lee, Chin Ho, et al.
Publicado: (2025)

Real Stability and Log Concavity are coNP-Hard
por: Chin, Tracy
Publicado: (2024)

4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete
por: Galliot, Florian
Publicado: (2025)

Communication complexity of pointer chasing via the fixed-set lemma
por: Viola, Emanuele
Publicado: (2025)

Fourier growth of structured $\mathbb{F}_2$-polynomials and applications
por: Błasiok, Jarosław, et al.
Publicado: (2021)

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
por: Ikenmeyer, Christian, et al.
Publicado: (2022)

HNN extensions of free groups with equal associated subgroups of finite index: polynomial time word problem
por: Shen, Hanwen, et al.
Publicado: (2025)

Low-Degree Polynomials Are Good Extractors
por: Alrabiah, Omar, et al.
Publicado: (2024)

Improved Lower Bounds for all Odd-Query Locally Decodable Codes
por: Basu, Arpon, et al.
Publicado: (2024)

On Approximability of Satisfiable $k$-CSPs: VI
por: Bhangale, Amey, et al.
Publicado: (2024)

On Approximability of Satisfiable $k$-CSPs: VII
por: Bhangale, Amey, et al.
Publicado: (2024)

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
por: Hsieh, Jun-Ting, et al.
Publicado: (2024)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzążewski Conjecture
por: Baril, Ambroise, et al.
Publicado: (2024)

A Subexponential Reduction from Product Partition to Subset Sum
por: Costandin, Marius
Publicado: (2024)

Constant Degree Direct Product Testers with Small Soundness
por: Bafna, Mitali, et al.
Publicado: (2024)

A criterion for Andrásfai--Erdős--Sós type theorems and applications
por: Hou, Jianfeng, et al.
Publicado: (2024)

Bisection Width, Discrepancy, and Eigenvalues of Hypergraphs
por: Räty, Eero, et al.
Publicado: (2024)

Parameterised Holant Problems
por: Aivasiliotis, Panagiotis, et al.
Publicado: (2024)

Corners in Quasirandom Groups via Sparse Mixing
por: Jaber, Michael, et al.
Publicado: (2024)

The Rank-Ramsey Problem and the Log-Rank Conjecture
por: Beniamini, Gal, et al.
Publicado: (2024)

A combinatorial view of Holant problems on higher domains
por: Liu, Yin
Publicado: (2024)

Reasonable Bounds for Combinatorial Lines of Length Three
por: Bhangale, Amey, et al.
Publicado: (2024)

Approximately counting maximal independent set is equivalent to #SAT
por: Zhang, Hao, et al.
Publicado: (2024)

Two-Source and Affine Non-Malleable Extractors for Small Entropy
por: Li, Xin, et al.
Publicado: (2024)

Computing eulerian magnitude homology
por: Menara, Giuliamaria, et al.
Publicado: (2024)

On the Nature and Complexity of an Impartial Two-Player Variant of the Game Lights-Out
por: Fiorini, Eugene, et al.
Publicado: (2024)

On the Structure of Hamiltonian Graphs with Small Independence Number
por: Jedličková, Nikola, et al.
Publicado: (2024)

Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
por: Minevich, Igor, et al.
Publicado: (2024)

$C_{2k+1}$-coloring of bounded-diameter graphs
por: Piecyk, Marta
Publicado: (2024)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

Refuting Perfect Matchings in Spectral Expanders is Hard
por: Biswas, Ari, et al.
Publicado: (2025)

A Note on the Complexity of Directed Clique
por: Gutowski, Grzegorz, et al.
Publicado: (2026)

Direct Product Primality Testing of Graphs is GI-hard
por: Calderoni, Luca, et al.
Publicado: (2020)

Monotone Circuit Complexity of Matching
por: Cavalar, Bruno, et al.
Publicado: (2025)

Hunting a rabbit: complexity, approximability and some characterizations
por: Ben-Ameur, Walid, et al.
Publicado: (2025)

On the Keevash-Knox-Mycroft Conjecture
por: Gan, Luyining, et al.
Publicado: (2022)

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
por: Borzechowski, Michaela, et al.
Publicado: (2023)

Sparse juntas on the biased hypercube
por: Dinur, Irit, et al.
Publicado: (2017)