:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Marchei, Daniele, Merelli, Emanuela, Francis, Andrew
Format:	Preprint
Published:	2024
Subjects:	Rings and Algebras Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2402.07874
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

On the uniqueness and computation of commuting extensions
by: Koiran, Pascal
Published: (2024)

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

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

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

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

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

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

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

Asynchronous Algorithmic Alignment with Cocycles
by: Dudzik, Andrew, et al.
Published: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Nonassociative cyclic algebras and the semiassociative Brauer monoid
by: Pumpluen, S
Published: (2024)

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

The Ideal Membership Problem and Abelian Groups
by: Bulatov, Andrei A., et al.
Published: (2022)

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

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

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

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

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

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

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

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

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

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

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

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