Imagen de Portada

Factorizing the Brauer monoid in polynomial time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Marchei, Daniele, Merelli, Emanuela, Francis, Andrew
Formato:	Preprint
Publicado:	2024
Materias:	Rings and Algebras Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Computing finite index congruences of finitely presented semigroups and monoids
por: Anagnostopoulou-Merkouri, Marina, et al.
Publicado: (2023)

Space of Data through the Lens of Multilevel Graph
por: Caputo, Marco, et al.
Publicado: (2025)

On the uniqueness and computation of commuting extensions
por: Koiran, Pascal
Publicado: (2024)

Dynamic programming by polymorphic semiring algebraic shortcut fusion
por: Little, Max A., et al.
Publicado: (2021)

Polynomial Algorithms for Simultaneous Unitary Similarity and Equivalence
por: VJ, Harikrishna, et al.
Publicado: (2025)

Computation of Jacobi sums of order l^2 and 2l^2 with prime l
por: Ahmed, Md. Helal, et al.
Publicado: (2019)

Algorithmic Problems in Categories of Partitions
por: Faroß, Nicolas, et al.
Publicado: (2025)

Tensor decomposition beyond uniqueness, with an application to the minrank problem
por: Koiran, Pascal, et al.
Publicado: (2025)

The minimal canonical form of a tensor network
por: Acuaviva, Arturo, et al.
Publicado: (2022)

On the Dynamics of Linear Finite Dynamical Systems Over Galois Rings
por: Kantic, Jonas, et al.
Publicado: (2026)

Randomized $k$-server in polynomial time
por: Coester, Christian, et al.
Publicado: (2026)

Canonical forms for matrix tuples in polynomial time
por: Qiao, Youming, et al.
Publicado: (2024)

On Computing the Dollo-1 phylogeny in polynomial time
por: Bonizzoni, Paola, et al.
Publicado: (2016)

Asynchronous Algorithmic Alignment with Cocycles
por: Dudzik, Andrew, et al.
Publicado: (2023)

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
por: Abrahamsen, Mikkel
Publicado: (2024)

Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering
por: Tran, Nguyen Khoa, et al.
Publicado: (2026)

A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
por: Cenciarelli, Pietro, et al.
Publicado: (2016)

Simple Linear-time Repetition Factorization
por: Yonemoto, Yuki, et al.
Publicado: (2024)

On polynomial kernelization for Stable Cutset
por: Kratsch, Stefan, et al.
Publicado: (2024)

Enumerating all minimal hitting sets in polynomial total time
por: Wild, Marcel
Publicado: (2023)

Delta-modular ILP Problems of Bounded Codimension, Discrepancy, and Convolution (new version)
por: Cherniavskii, M., et al.
Publicado: (2024)

A $O^*((2 + ε)^k)$ Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs
por: Lafond, Manuel, et al.
Publicado: (2026)

Simulating Gaussian boson sampling on graphs in polynomial time
por: Anand, Konrad, et al.
Publicado: (2025)

A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth
por: Kratsch, Stefan
Publicado: (2026)

Constant congestion linkages in polynomially strong digraphs in polynomial time
por: Lopes, Raul, et al.
Publicado: (2024)

Optimizing Distances for Multi-Broadcast in Temporal Graphs
por: Carnevale, Daniele, et al.
Publicado: (2026)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
por: Clementino, Thailsson, et al.
Publicado: (2025)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
por: Grigoriev, Alexander, et al.
Publicado: (2025)

Nonassociative cyclic algebras and the semiassociative Brauer monoid
por: Pumpluen, S
Publicado: (2024)

An Objective Improvement Approach to Solving Discounted Payoff Games
por: Dell'Erba, Daniele, et al.
Publicado: (2024)

A Tight Lower Bound for Cycle Detection in Grid Graphs
por: Au, Andrew
Publicado: (2026)

Exact (n + 2) Comparison Complexity for the N-Repeated Element Problem
por: Au, Andrew
Publicado: (2026)

Two Linear Passes Are Necessary for Sum-Exclude-Self Under Sublinear Space
por: Au, Andrew
Publicado: (2026)

Algorithms for Galois Words: Detection, Factorization, and Rotation
por: Hendrian, Diptarama, et al.
Publicado: (2024)

On Thin Perfect Matchings up to Polylogarithmic Factors
por: Haqi, Alireza, et al.
Publicado: (2026)

Lempel-Ziv (LZ77) Factorization in Sublinear Time
por: Kempa, Dominik, et al.
Publicado: (2024)

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
por: Zhou, Jianqi, et al.
Publicado: (2025)

Longest Unbordered Factors on Run-Length Encoded Strings
por: Sekizaki, Shoma, et al.
Publicado: (2025)

Quantum Speedup for Spectral Approximation of Kronecker Products
por: Gao, Yeqi, et al.
Publicado: (2024)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)