:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Becker, Oren, Lubotzky, Alexander, Mosheiff, Jonathan
Format:	Preprint
Publié:	2020
Sujets:	Data Structures and Algorithms Combinatorics Group Theory
Accès en ligne:	https://arxiv.org/abs/2011.05234
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Testability in group theory
par: Becker, Oren, et autres
Publié: (2022)

Explicit Lossless Vertex Expanders
par: Hsieh, Jun-Ting, et autres
Publié: (2025)

Abelian groups are polynomially stable
par: Becker, Oren, et autres
Publié: (2018)

On the Constant-Depth Circuit Complexity of Generating Quasigroups
par: Collins, Nathaniel A., et autres
Publié: (2024)

A Faster Isomorphism Test for Graphs of Small Degree
par: Grohe, Martin, et autres
Publié: (2018)

Finite matrix multiplication algorithms from infinite groups
par: Blasiak, Jonah, et autres
Publié: (2024)

Showcasing straight-line programs with memory via matrix Bruhat decomposition
par: Niemeyer, Alice C., et autres
Publié: (2013)

The $Z$-Curve as an $n$-Dimensional Hypersphere: Properties and Analysis
par: Gonzalez, Diego Vazquez, et autres
Publié: (2024)

Complexity of Constructing Minimal Faithful Permutation Representations for Fitting-free Groups
par: Levet, Michael, et autres
Publié: (2025)

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
par: Johnson, Dan, et autres
Publié: (2025)

The Generalized Skew Spectrum of Graphs
par: Bellante, Armando, et autres
Publié: (2025)

Breaking the cubic barrier in the Solovay-Kitaev algorithm
par: Kuperberg, Greg
Publié: (2023)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
par: Ahmadypour, Niloufar, et autres
Publié: (2020)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
par: Li, Xin, et autres
Publié: (2024)

Perturbation-Resilient Trades for Dynamic Service Balancing
par: Sima, Jin, et autres
Publié: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Unbounded Error Correcting Codes
par: Efremenko, Klim, et autres
Publié: (2024)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
par: Con, Roni, et autres
Publié: (2024)

Trellis codes with a good distance profile constructed from expander graphs
par: Zhu, Yubin, et autres
Publié: (2026)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

On 2-strong connectivity orientations of mixed graphs and related problems
par: Georgiadis, Loukas, et autres
Publié: (2023)

Conditional Non-Soficity of p-adic Deligne Extensions: on a Theorem of Gohla and Thom
par: Chapman, Michael, et autres
Publié: (2024)

Non-commutative error correcting codes and proper subgroup testing
par: Chapman, Michael, et autres
Publié: (2024)

Streaming algorithms for groups and semigroups
par: Lohrey, Markus, et autres
Publié: (2022)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
par: Aubian, Guillaume, et autres
Publié: (2025)

Short circuit walks in fixed dimension
par: Black, Alexander E., et autres
Publié: (2025)

The Simultaneous Triple Product Property and Group-theoretic Results for the Exponent of Matrix Multiplication
par: Murthy, Sandeep
Publié: (2007)

Statistical inference of a ranked community in a directed graph
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Composition of random functions and word reconstruction
par: Chapuy, Guillaume, et autres
Publié: (2026)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
par: Hou, Jiaxin, et autres
Publié: (2023)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
par: Goldenberg, Elazar, et autres
Publié: (2024)

On constrained intersection representations of graphs and digraphs
par: Cicalese, Ferdinando, et autres
Publié: (2025)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
par: Fujimaru, Hiroto, et autres
Publié: (2025)

A new approach to bipartite stable matching optimization
par: Fleiner, Tamás, et autres
Publié: (2024)

PackIt! Gamified Rectangle Packing
par: Garrison, Thomas, et autres
Publié: (2024)

Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
par: Cheng, Christine T., et autres
Publié: (2026)

Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters
par: Harvey, Nicholas, et autres
Publié: (2024)

Construction of orientable sequences in $O(1)$-amortized time per bit
par: Gabric, Daniel, et autres
Publié: (2024)

Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
par: Dikstein, Yotam, et autres
Publié: (2024)

Systematic Approach to Hyperbolic Quantum Error Correction Codes
par: Mahmoud, Ahmed Adel, et autres
Publié: (2025)