Imagen de Portada

Correcting matrix products over the ring of integers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wu, Yu-Lun, Wang, Hung-Lung
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
por: Tan, Jingjing
Publicado: (2024)

Optimal Padded Decomposition For Bounded Treewidth Graphs
por: Filtser, Arnold, et al.
Publicado: (2024)

Fast approximation algorithms for the 1-median problem on real-world large graphs
por: Ueta, Keisuke, et al.
Publicado: (2025)

Coarse Balanced Separators in Fat-Minor-Free Graphs
por: Bonnet, Édouard, et al.
Publicado: (2026)

Depth-13 Sorting Networks for 28 Channels
por: Wang, Chengu
Publicado: (2025)

Determining Implication of Fixed Matrix Prenex Normal Forms Can Be Decided in Linear Time
por: Wang, Adam
Publicado: (2025)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
por: Xiao, Chenglong, et al.
Publicado: (2024)

Approximately covering vertices by order-$5$ or longer paths
por: Gong, Mingyang, et al.
Publicado: (2024)

Counting random $k$-SAT near the satisfiability threshold
por: Chen, Zongchen, et al.
Publicado: (2024)

The complexity of strong conflict-free vertex-connection $k$-colorability
por: Hsieh, Sun-Yuan, et al.
Publicado: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
por: An, Shinwoo, et al.
Publicado: (2025)

Max Weight Independent Set in sparse graphs with no long claws
por: Abrishami, Tara, et al.
Publicado: (2023)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
por: Ingels, Florian
Publicado: (2023)

Solving the List Coloring Problem through a Branch-and-Price algorithm
por: Lucci, Mauro, et al.
Publicado: (2023)

Continuous optimization methods for the graph isomorphism problem
por: Klus, Stefan, et al.
Publicado: (2023)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
por: Efthymiou, Charilaos, et al.
Publicado: (2023)

Distance-Preserving Graph Compression Techniques
por: Madani, Amirali, et al.
Publicado: (2023)

An Enumerative Perspective on Connectivity
por: Akmal, Shyan
Publicado: (2023)

The Role of Dimension in the Online Chasing Problem
por: Papazov, Hristo
Publicado: (2023)

Theoretical analysis of git bisect
por: Courtiel, Julien, et al.
Publicado: (2023)

Simultaneous Drawing of Layered Trees
por: Katheder, Julia, et al.
Publicado: (2023)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
por: Baswana, Surender, et al.
Publicado: (2023)

Isomorphism for Tournaments of Small Twin Width
por: Grohe, Martin, et al.
Publicado: (2023)

Triangle-free 2-matchings
por: Paluch, Katarzyna
Publicado: (2023)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
por: Davies, Sami, et al.
Publicado: (2023)

Splitting-off in Hypergraphs
por: Bérczi, Kristóf, et al.
Publicado: (2023)

On the Relationship Between Several Variants of the Linear Hashing Conjecture
por: Westover, Alek
Publicado: (2023)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
por: Antony, Dhanyamol, et al.
Publicado: (2023)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2023)

String Matching with a Dynamic Pattern
por: Monteiro, Bruno, et al.
Publicado: (2025)

Tight Localizations of Feedback Sets
por: Hecht, Michael, et al.
Publicado: (2020)

Inverse matroid optimization under subset constraints
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
por: Jordon, Addie, et al.
Publicado: (2025)

Graph Coloring Below Guarantees via Co-Triangle Packing
por: Akmal, Shyan, et al.
Publicado: (2025)

Fast Makespan Minimization via Short ILPs
por: Hermelin, Danny, et al.
Publicado: (2026)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
por: Bals, Ben, et al.
Publicado: (2025)

A Unified Approach to Minimizing Symmetric Submodular Functions
por: Iwata, Satoru, et al.
Publicado: (2026)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
por: Harada, Tsubasa
Publicado: (2024)