Pages that link to "Item:Q3891677"
From MaRDI portal
The following pages link to Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix (Q3891677):
Displaying 50 items.
- Note on shortest and nearest lattice vectors (Q286988) (← links)
- An interpolating sequent calculus for quantifier-free Presburger arithmetic (Q438556) (← links)
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient (Q438742) (← links)
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices (Q504418) (← links)
- On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
- Lattice polly cracker cryptosystems (Q633081) (← links)
- The co-discovery of conservation laws and particle families (Q643459) (← links)
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere (Q672249) (← links)
- Proving nonreachability by modulo-invariants (Q672866) (← links)
- A decision algorithm for linear sentences on a PFM (Q685065) (← links)
- Computing the volume, counting integral points, and exponential sums (Q685177) (← links)
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra (Q695630) (← links)
- An application of the Hermite normal form in integer programming (Q757241) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- Lattice based extended formulations for integer linear equality systems (Q847838) (← links)
- Additive edge labelings (Q968162) (← links)
- Fast computation of Hermite normal forms of random integer matrices (Q984852) (← links)
- Integer programming with 2-variable equations and 1-variable inequalities (Q987826) (← links)
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems (Q1040730) (← links)
- Multivariate periodic wavelet analysis (Q1045708) (← links)
- Complexity questions in number theory (Q1059094) (← links)
- Solving systems of linear equations over polynomials (Q1082773) (← links)
- Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic (Q1097642) (← links)
- An \(NC^ 2\) algorithm for testing similarity of matrices (Q1116651) (← links)
- On isomorphism testing of a class of 2-nilpotent groups (Q1174452) (← links)
- Which new RSA-signatures can be computed from certain given RSA- signatures! (Q1184507) (← links)
- Complexity of the closest vector problem in a lattice generated by a (0,1)-matrix (Q1198041) (← links)
- Recognizing badly presented \(Z\)-modules (Q1311319) (← links)
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients (Q1351936) (← links)
- Real data-integer solution problems within the Blum-Shub-Smale computational model (Q1368838) (← links)
- Decision problems in quadratic function fields of high genus (Q1578426) (← links)
- Complexity of the Havas, Majewski, Matthews LLL Hermite normal form algorithm (Q1587234) (← links)
- From Feynman rules to conserved quantum numbers. I (Q1685809) (← links)
- Twisted \(\Gamma \times \mathbb T^n\)-equivariant degree with \(n\)-parameters: computational formulae and applications (Q1687157) (← links)
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) (Q1725693) (← links)
- Identifying lens spaces in polynomial time (Q1743503) (← links)
- Computational complexity and 3-manifolds and zombies (Q1785090) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- The union of balls and its dual shape (Q1892419) (← links)
- The determination of canonical forms for lattice quadrature rules (Q1899974) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- Computation of cubical homology, cohomology, and (co)homological operations via chain contraction (Q2017610) (← links)
- A simplex algorithm for rational cp-factorization (Q2020599) (← links)
- Orientable quadratic equations in free metabelian groups (Q2029200) (← links)
- Frontiers of sphere recognition in practice (Q2098099) (← links)
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix (Q2100051) (← links)
- Codeterminantal graphs (Q2154283) (← links)
- Total dual dyadicness and dyadic generating sets (Q2164668) (← links)
