Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
integer matrices
Description:
Matrices whose entries are integers, studied in linear algebra, number theory, and exact computation.
Related topics:
Matrix Theory and Algorithms (17%),
Polynomial and algebraic computation (15%),
Advanced Combinatorial Mathematics (12%),
Complexity and Algorithms in Graphs (8%)
Wikidata ID:
wiki/Q6042601
OpenAlex ID:
keywords/integer-matrices
Matching is as easy as matrix inversion
1987
·
Ketan Mulmuley
, Umesh V. Vazirani
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
689
PDF
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
1979
·
Ravindran Kannan
, Achim Bachem
·
SIAM Journal on Computing
·
510
The Lyapunov exponent and joint spectral radius of pairs of matrices are hard?when not impossible?to compute and to approximate
1997
·
John N. Tsitsiklis
, Vincent D. Blondel
·
Mathematics of Control Signals and Systems
·
320
Bounds on Positive Integral Solutions of Linear Diophantine Equations
1976
·
I. Borosh
, L. B. Treybig
·
Proceedings of the American Mathematical Society
·
249
PDF
Self-Similar Sets 5. Integer Matrices and Fractal Tilings of ℝ n
1991
·
Christoph Bandt
·
Proceedings of the American Mathematical Society
·
191
On the complexity of computing determinants
2005
·
Erich Kaltofen
, Gilles Villard
·
Computational Complexity
·
176
NP-Completeness of the linear complementarity problem
1989
·
S. J. Chung
·
Journal of Optimization Theory and Applications
·
170
Near optimal algorithms for computing Smith normal forms of integer matrices
1996
·
Arne Storjohann
·
International Symposium on Symbolic and Algebraic Computation
·
162
Tropical discriminants
2007
·
Alicia Dickenstein
, Eva Feichtner
, et al.
·
Journal of the American Mathematical Society
·
151
PDF
Algorithms for the Solution of Systems of Linear Diophantine Equations
1982
·
Tsu-Wu J. Chou
, George E. Collins
·
SIAM Journal on Computing
·
143
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
1989
·
Costas S. Iliopoulos
·
SIAM Journal on Computing
·
136
Efficient Delaunay triangulation using rational arithmetic
1991
·
Michael Karasick
, Derek Lieber
, et al.
·
ACM Transactions on Graphics
·
131
PDF
Smith normal form in combinatorics
2016
·
Richard P. Stanley
·
Journal of Combinatorial Theory Series A
·
128
Determinant: Combinatorics, Algorithms, and Complexity
1997
·
Meena Mahajan
, V. Vinay
·
Chicago Journal of Theoretical Computer Science
·
123
An Axiomatic Approach to Proportionality Between Matrices
1989
·
M. L. Balinski
, G. Demange
·
Mathematics of Operations Research
·
123
Asymptotically Fast Triangularization of Matrices over Rings
1991
·
James L. Hafner
, Kevin S. McCurley
·
SIAM Journal on Computing
·
118
PDF
Safe and effective determinant evaluation
1992
·
K.L. Clarkson
·
Annual Symposium on Foundations of Computer Science
·
115
Asymptotically fast computation of Hermite normal forms of integer matrices
1996
·
Arne Storjohann
, George Labahn
·
International Symposium on Symbolic and Algebraic Computation
·
111
PDF
Algorithms for proportional matrices in reals and integers
1989
·
M. L. Balinski
, G. Demange
·
Mathematical Programming
·
110
Hermite Normal Form Computation Using Modulo Determinant Arithmetic
1987
·
P. D. Domich
, R. Kannan
, et al.
·
Mathematics of Operations Research
·
107
The equation A⊗x=B⊗y over (max,+)
2003
·
R.A. Cuninghame-Green
, P. Butkovic
·
Theoretical Computer Science
·
102
PDF
The complexity of matrix rank and feasible systems of linear equations
1999
·
E. Allender
, R. Beals
, et al.
·
Computational Complexity
·
101
Complexity of parallel matrix computations
1987
·
Victor Pan
·
Theoretical Computer Science
·
100
PDF
The shifted number system for fast linear algebra on integer matrices
2005
·
Arne Storjohann
·
Journal of Complexity
·
98
PDF
Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product
2016
·
Karl Bringmann
, Fabrizio Grandoni
, et al.
·
SIAM Journal on Computing
·
96
PDF
Show more works
View as search
Works count:
1,173
Citation count:
12,530
Year
Topic
Type