Solving sparse linear equations over finite fields
From MaRDI portal
Publication:3746790
DOI10.1109/TIT.1986.1057137zbMath0607.65015MaRDI QIDQ3746790
Publication date: 1986
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
finite fields; rank; determinant; probabilistic algorithm; sparse systems; minimum polynomial; random method; coordinate recurrence method
15B33: Matrices over special rings (quaternions, finite fields, etc.)
65F40: Numerical computation of determinants
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Growth Functions and Automatic Groups, Subquadratic-time factoring of polynomials over finite fields, The black-box Niederreiter algorithm and its implementation over the binary field, The irreducibility of some level 1 Hecke polynomials, Factoring multivariate polynomials via partial differential equations, Using number fields to compute logarithms in finite fields, Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes, Factoring polynomials over finite fields: A survey, On efficient sparse integer matrix Smith normal form computations, Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, Parallel algorithms for matrix normal forms, Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators, Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes, Discrete logarithms in \(\mathrm{GF}(p)\), Univariate polynomial factorization over finite fields, Techniques for exploiting structure in matrix formulae of the sparse resultant, Parametrization of Newton's iteration for computations with structured matrices and applications, Density of normal elements, A new efficient algorithm for computing Gröbner bases \((F_4)\), Modifications to the number field sieve, Solving linear equations over GF(2): Block Lanczos algorithm, Factorization of polynomials and some linear-algebra problems over finite fields, Finding succinct ordered minimal perfect hash functions, Efficient matrix preconditioners for black box linear algebra, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Algebraic and numerical techniques for the computation of matrix determinants, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, Symbolic and numeric methods for exploiting structure in constructing resultant matrices, Improved algorithms for computing determinants and resultants, A note on the factorization method of Niederreiter, Matrices in elimination theory, Early termination in sparse interpolation algorithms, On the density of normal bases in finite fields, New techniques for the computation of linear recurrence coefficients, An algorithm to solve integer linear systems exactly using numerical methods, Exact solutions to linear programming problems, Certified dense linear system solving, Certified sparse linear system solving, The index calculus method using non-smooth polynomials, Special prime numbers and discrete logs in finite prime fields, A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields, The Function Field Sieve in the Medium Prime Case, A Rigorous Subexponential Algorithm For Computation of Class Groups, A Rigorous Time Bound for Factoring Integers, Euclid’s algorithm and the Lanczos method over finite fields
