Cover Image

About the Kannan-Bachem algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Sergeraert, Francis
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms 15A21 G.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmetic
by: Paszyński, Maciej
Published: (2024)

Reserve Matching with Thresholds
by: Evren, Suat
Published: (2023)

Pop Stacks with a Bypass
by: Cioni, Lapo, et al.
Published: (2024)

Generating Signed Permutations by Twisting Two-Sided Ribbons
by: Yuan, et al.
Published: (2023)

An O(nlogn) approximate knapsack algorithm
by: Dawes, Nick
Published: (2025)

Communication efficient application of sequences of planar rotations to a matrix
by: Steel, Thijs, et al.
Published: (2024)

Selective algorithm processing of subset sum distributions
by: Dawes, Nick
Published: (2024)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
by: Streit, Robert P., et al.
Published: (2024)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)

Restless reachability problems in temporal graphs
by: Thejaswi, Suhas, et al.
Published: (2020)

Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems
by: Akef, Hamidreza, et al.
Published: (2025)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
by: Baruchel, Thomas
Published: (2025)

List Coloring of some Cayley graphs using Kernel perfections
by: S, Prajnanaswaroopa
Published: (2024)

Alon-Tarsi Number of Some Regular Graphs
by: Prajnanaswaroopa, S.
Published: (2023)

Additive estimates of the permanent using Gaussian fields
by: Mukerji, Tantrik, et al.
Published: (2022)

Benchmarking of algorithms for set partitions
by: Khinvasara, Arnav, et al.
Published: (2026)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
by: Shota, Kan, et al.
Published: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
by: Adamson, Duncan, et al.
Published: (2023)

Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025)

Deterministic complexity analysis of Hermitian eigenproblems
by: Sobczyk, Aleksandros
Published: (2024)

Invariant subspaces and PCA in nearly matrix multiplication time
by: Sobczyk, Aleksandros, et al.
Published: (2023)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
by: Bhattacharjee, Rajarshi, et al.
Published: (2024)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

A linear-time algorithm for Chow decompositions
by: Blomenhofer, Alexander Taveira, et al.
Published: (2025)

Detecting null patterns in tensor data
by: Brooksbank, Peter A., et al.
Published: (2024)

Reducing the Space Used by the Sieve of Eratosthenes When Factoring
by: Hartman, Samuel, et al.
Published: (2024)

Rabin Games and Colourful Universal Trees
by: Majumdar, Rupak, et al.
Published: (2024)

Does block size matter in randomized block Krylov low-rank approximation?
by: Chen, Tyler, et al.
Published: (2025)

Counting overlapping pairs of words
by: Rivals, Eric, et al.
Published: (2024)

Smoothed Analysis of Interior-Point Algorithms: Condition Number
by: Dunagan, John, et al.
Published: (2003)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
by: Spielman, Daniel A., et al.
Published: (2003)

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
by: Spielman, Daniel A., et al.
Published: (2006)

A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
by: Stapleton, Joshua
Published: (2025)

Optimal Stopping Methodology for the Secretary Problem with Random Queries
by: Moustakides, George V., et al.
Published: (2021)

Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
by: Andersson, Joel, et al.
Published: (2026)

Exact Computation of the Catalan Number $C(2,050,572,903)$
by: Ramani, Mahesh
Published: (2026)

Mixed-Precision in High-Order Methods: the Impact of Floating-Point Precision on the ADER-DG Algorithm
by: Marot-Lassauzaie, Marc, et al.
Published: (2025)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)