Copertina

The average-case complexity of the Word Problem for groups of matrices over $\mathbb{Z}$ is linear

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bassino, Frédérique, Nicaud, Cyril, Weil, Pascal
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Group Theory 20F10, 68Q25, 68W40
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Runtime Analyses of NSGA-III on Many-Objective Problems
di: Opris, Andre, et al.
Pubblicazione: (2024)

Linear average-case complexity of algorithmic problems in groups
di: Olshanskii, Alexander, et al.
Pubblicazione: (2022)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
di: Opris, Andre, et al.
Pubblicazione: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
di: Bubeck, Sébastien, et al.
Pubblicazione: (2022)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

Many Objective Problems Where Crossover is Provably Essential
di: Opris, Andre
Pubblicazione: (2024)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
di: Cai, HanQin, et al.
Pubblicazione: (2023)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
di: Opris, Andre
Pubblicazione: (2025)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
di: Matti, Fabio, et al.
Pubblicazione: (2025)

A fast algorithm for Stallings foldings over virtually free groups
di: Cookson, Sam, et al.
Pubblicazione: (2023)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
di: Opris, Andre
Pubblicazione: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
di: Hougardy, Stefan, et al.
Pubblicazione: (2025)

Random generation of subgroups of the modular group with a fixed isomorphism type
di: Bassino, Frédérique, et al.
Pubblicazione: (2023)

The word problem for the mapping class group in quasi-linear time
di: Bell, Mark C., et al.
Pubblicazione: (2025)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

Constrained inhomogeneous spherical equations: average-case hardness
di: Ushakov, Alexander
Pubblicazione: (2024)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
di: López, Francisco, et al.
Pubblicazione: (2023)

Hybrid hierarchical matrices with adaptive mixed precision storage
di: Khan, Ritesh, et al.
Pubblicazione: (2026)

One-variable equations over the lamplighter group
di: Ushakov, Alexander, et al.
Pubblicazione: (2026)

Algorithms for experimenting with Zariski dense matrix groups over number fields
di: Detinko, A. S., et al.
Pubblicazione: (2026)

The central tree property and algorithmic problems on subgroups of free groups
di: Roy, Mallika, et al.
Pubblicazione: (2023)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
di: Gu, Qian-Ping, et al.
Pubblicazione: (2025)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
di: Feldman, Moran, et al.
Pubblicazione: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

Quadratic equations in the lamplighter group
di: Ushakov, Alexander, et al.
Pubblicazione: (2023)

Sum-of-Gaussians tensor neural networks for high-dimensional Schrödinger equation
di: Zhou, Qi, et al.
Pubblicazione: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
di: Newman, Ilan, et al.
Pubblicazione: (2021)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
di: Andreou, Pantelis, et al.
Pubblicazione: (2024)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
di: Roucairol, Milo, et al.
Pubblicazione: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

Algorithms for Generating Small Random Samples
di: Cicirello, Vincent A.
Pubblicazione: (2024)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

HaTT: Hadamard avoiding TT recompression
di: Sun, Zhonghao, et al.
Pubblicazione: (2024)

The Word Problem for Finitary Automaton Groups
di: Kotowsky, Maximilian, et al.
Pubblicazione: (2023)

On the ET0L subgroup membership problem in bounded automata groups
di: Bishop, Alex, et al.
Pubblicazione: (2024)

Optimal non-adaptive algorithm for edge estimation
di: Bishnu, Arijit, et al.
Pubblicazione: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
di: Opris, Andre
Pubblicazione: (2025)