Cover Image

Canonical forms for matrix tuples in polynomial time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Qiao, Youming, Sun, Xiaorui
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Revisiting Tree Canonization using polynomials
by: Arvind, V., et al.
Published: (2024)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
by: Jin, Wenyu, et al.
Published: (2024)

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

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

Random tensor isomorphism under orthogonal and unitary actions
by: Chizewer, Jeremy, et al.
Published: (2026)

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

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

Dynamic Kernel Graph Sparsifiers
by: Cao, Yang, et al.
Published: (2022)

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
by: Li, Tiange, et al.
Published: (2026)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
by: Harris, David G.
Published: (2021)

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

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

Factorizing the Brauer monoid in polynomial time
by: Marchei, Daniele, et al.
Published: (2024)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
by: Chen, Tyler, et al.
Published: (2022)

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

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

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

Finding missing items requires strong forms of randomness
by: Chakrabarti, Amit, et al.
Published: (2023)

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

Optimal $k$-Secretary with Logarithmic Memory
by: Qiao, Mingda, et al.
Published: (2025)

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

Fixed-sparsity matrix approximation from matrix-vector products
by: Amsel, Noah, et al.
Published: (2024)

Near-optimal hierarchical matrix approximation from matrix-vector products
by: Chen, Tyler, et al.
Published: (2024)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
by: Ye, Xiaowei, et al.
Published: (2024)

Scalable $k$-clique Densest Subgraph Search
by: Ye, Xiaowei, et al.
Published: (2024)

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

Randomized and quantum approximate matrix multiplication
by: Apers, Simon, et al.
Published: (2025)

Online busy time scheduling with flexible jobs
by: Albers, Susanne, et al.
Published: (2024)

A Polynomial time Algorithm for 3SAT
by: Du, Lizhi
Published: (2010)

Online matching with delays and stochastic arrival times
by: Mari, Mathieu, et al.
Published: (2022)

Multiplication of polynomials over the binary field
by: Liu, Chunlei
Published: (2025)

Quasilinear-time eccentricities computation, and more, on median graphs
by: Bergé, Pierre, et al.
Published: (2024)

Near-real-time Solutions for Online String Problems
by: Köppl, Dominik, et al.
Published: (2026)

Smallest suffixient set maintenance in near-real-time
by: Köppl, Dominik, et al.
Published: (2026)

Correcting matrix products over the ring of integers
by: Wu, Yu-Lun, et al.
Published: (2023)

Better space-time-robustness trade-offs for set reconciliation
by: Belazzougui, Djamal, et al.
Published: (2024)

Dynamic O(arboricity) coloring in polylogarithmic worst-case time
by: Ghaffari, Mohsen, et al.
Published: (2024)

Edge-coloring sparse graphs with $Δ$ colors in quasilinear time
by: Kowalik, Lukasz
Published: (2024)

Space-time Trade-offs for the LCP Array of Wheeler DFAs
by: Cotumaccio, Nicola, et al.
Published: (2023)

Improved Sublinear-time Moment Estimation using Weighted Sampling
by: Bhattacharya, Anup, et al.
Published: (2025)