Copertina

Computing bases in Hermite normal form of lattices of integer relations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Labahn, George, Storjohann, Arne
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms Computational Complexity Symbolic Computation Rings and Algebras 68Q25, 68W30, 15A21, 15A36 I.1.2; F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A C implementation of the Smith massager algorithm
di: Wang, Ziwen, et al.
Pubblicazione: (2026)

Matrix equivalence to Smith normal form: new theoretical results for multivariate polynomial matrices
di: Lu, Dong, et al.
Pubblicazione: (2026)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

An Exact Algorithm for Computing the Structure of Jordan Blocks
di: Tajima, Shinichi, et al.
Pubblicazione: (2025)

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

Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Jordan-Krylov Basis
di: Tajima, Shinichi, et al.
Pubblicazione: (2022)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

Polynomial-Time Algorithms for Black-Box Distributive Expanded Groups
di: Anokhin, Mikhail
Pubblicazione: (2025)

Smith normal forms of bivariate polynomial matrices
di: Lu, Dong, et al.
Pubblicazione: (2025)

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
di: Koiran, Pascal, et al.
Pubblicazione: (2024)

From approximate to exact integer programming
di: Dadush, Daniel, et al.
Pubblicazione: (2022)

Completeness classes in algebraic complexity theory
di: Bürgisser, Peter
Pubblicazione: (2024)

The Subspace Flatness Conjecture and Faster Integer Programming
di: Reis, Victor, et al.
Pubblicazione: (2023)

The Quasi-probability Method and Applications for Trace Reconstruction
di: Rubinstein, Ittai
Pubblicazione: (2024)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
di: Komusiewicz, Christian, et al.
Pubblicazione: (2023)

Computing discrete residues of rational functions
di: Arreche, Carlos E., et al.
Pubblicazione: (2024)

Integer multiplication is at least as hard as matrix transposition
di: Harvey, David, et al.
Pubblicazione: (2025)

$XX^{t}$ Can Be Faster
di: Rybin, Dmitry, et al.
Pubblicazione: (2025)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
di: Zhong, Xianghui
Pubblicazione: (2018)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
di: Grochow, Joshua A., et al.
Pubblicazione: (2025)

On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications
di: Grochow, Joshua A., et al.
Pubblicazione: (2023)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
di: Grochow, Joshua A., et al.
Pubblicazione: (2021)

Count-Free Weisfeiler--Leman and Group Isomorphism
di: Collins, Nathaniel A., et al.
Pubblicazione: (2022)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
di: Gabryelski, Wojciech, et al.
Pubblicazione: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

Barriers for rectangular matrix multiplication
di: Christandl, Matthias, et al.
Pubblicazione: (2020)

Recent Advances in Debordering Methods
di: Dutta, Pranjal, et al.
Pubblicazione: (2025)

Amnesiac Flooding: Easy to break, hard to escape
di: Austin, Henry, et al.
Pubblicazione: (2025)

On weighted graph separation problems and flow-augmentation
di: Kim, Eun Jung, et al.
Pubblicazione: (2022)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
di: Koiran, Pascal, et al.
Pubblicazione: (2022)

Counting Martingales for Measure and Dimension in Complexity Classes
di: Hitchcock, John M., et al.
Pubblicazione: (2025)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
di: Chen, Yijia, et al.
Pubblicazione: (2023)

The Optimizer Quotient and the Certification Trilemma
di: Simas, Tristan
Pubblicazione: (2026)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
di: Kumar, Mrinal, et al.
Pubblicazione: (2018)

On (In)approximability of MaxMin Independent Set Reconfiguration
di: Hoang, Hung P., et al.
Pubblicazione: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

On Solving Reachability in Grid Digraphs using a Psuedoseparator
di: Jain, Rahul, et al.
Pubblicazione: (2019)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
di: Jansen, Klaus, et al.
Pubblicazione: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
di: Khoruzhii, Kirill, et al.
Pubblicazione: (2025)