Image de couverture de livre

Correcting matrix products over the ring of integers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wu, Yu-Lun, Wang, Hung-Lung
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Optimal Padded Decomposition For Bounded Treewidth Graphs
par: Filtser, Arnold, et autres
Publié: (2024)

Fast approximation algorithms for the 1-median problem on real-world large graphs
par: Ueta, Keisuke, et autres
Publié: (2025)

Coarse Balanced Separators in Fat-Minor-Free Graphs
par: Bonnet, Édouard, et autres
Publié: (2026)

Depth-13 Sorting Networks for 28 Channels
par: Wang, Chengu
Publié: (2025)

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

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
par: Xiao, Chenglong, et autres
Publié: (2024)

Approximately covering vertices by order-$5$ or longer paths
par: Gong, Mingyang, et autres
Publié: (2024)

Counting random $k$-SAT near the satisfiability threshold
par: Chen, Zongchen, et autres
Publié: (2024)

The complexity of strong conflict-free vertex-connection $k$-colorability
par: Hsieh, Sun-Yuan, et autres
Publié: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)

Max Weight Independent Set in sparse graphs with no long claws
par: Abrishami, Tara, et autres
Publié: (2023)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
par: Ingels, Florian
Publié: (2023)

Solving the List Coloring Problem through a Branch-and-Price algorithm
par: Lucci, Mauro, et autres
Publié: (2023)

Continuous optimization methods for the graph isomorphism problem
par: Klus, Stefan, et autres
Publié: (2023)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
par: Efthymiou, Charilaos, et autres
Publié: (2023)

Distance-Preserving Graph Compression Techniques
par: Madani, Amirali, et autres
Publié: (2023)

An Enumerative Perspective on Connectivity
par: Akmal, Shyan
Publié: (2023)

The Role of Dimension in the Online Chasing Problem
par: Papazov, Hristo
Publié: (2023)

Theoretical analysis of git bisect
par: Courtiel, Julien, et autres
Publié: (2023)

Simultaneous Drawing of Layered Trees
par: Katheder, Julia, et autres
Publié: (2023)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
par: Baswana, Surender, et autres
Publié: (2023)

Isomorphism for Tournaments of Small Twin Width
par: Grohe, Martin, et autres
Publié: (2023)

Triangle-free 2-matchings
par: Paluch, Katarzyna
Publié: (2023)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
par: Davies, Sami, et autres
Publié: (2023)

Splitting-off in Hypergraphs
par: Bérczi, Kristóf, et autres
Publié: (2023)

On the Relationship Between Several Variants of the Linear Hashing Conjecture
par: Westover, Alek
Publié: (2023)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
par: Antony, Dhanyamol, et autres
Publié: (2023)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)

Tight Localizations of Feedback Sets
par: Hecht, Michael, et autres
Publié: (2020)

Inverse matroid optimization under subset constraints
par: Bérczi, Kristóf, et autres
Publié: (2025)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
par: Jordon, Addie, et autres
Publié: (2025)

Graph Coloring Below Guarantees via Co-Triangle Packing
par: Akmal, Shyan, et autres
Publié: (2025)

Fast Makespan Minimization via Short ILPs
par: Hermelin, Danny, et autres
Publié: (2026)

An Approximation Algorithm for Monotone Submodular Cost Allocation
par: Mizutani, Ryuhei
Publié: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

A Unified Approach to Minimizing Symmetric Submodular Functions
par: Iwata, Satoru, et autres
Publié: (2026)

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