Pages that link to "Item:Q3746790"
From MaRDI portal
The following pages link to Solving sparse linear equations over finite fields (Q3746790):
Displayed 46 items.
- On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes (Q957695) (← links)
- Discrete logarithms in \(\mathrm{GF}(p)\) (Q1094455) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- Density of normal elements (Q1266417) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Modifications to the number field sieve (Q1310453) (← links)
- Solving linear equations over GF(2): Block Lanczos algorithm (Q1311312) (← links)
- Factorization of polynomials and some linear-algebra problems over finite fields (Q1311328) (← links)
- Finding succinct ordered minimal perfect hash functions (Q1336764) (← links)
- Efficient matrix preconditioners for black box linear algebra (Q1348088) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- A note on the factorization method of Niederreiter (Q1779329) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Early termination in sparse interpolation algorithms (Q1878478) (← links)
- On the density of normal bases in finite fields (Q1971063) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- An algorithm to solve integer linear systems exactly using numerical methods (Q2457353) (← links)
- Exact solutions to linear programming problems (Q2467437) (← links)
- Certified dense linear system solving (Q2643521) (← links)
- Certified sparse linear system solving (Q2643567) (← links)
- The index calculus method using non-smooth polynomials (Q2719078) (← links)
- Special prime numbers and discrete logs in finite prime fields (Q2759106) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- A Rigorous Subexponential Algorithm For Computation of Class Groups (Q3480172) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- A Rigorous Time Bound for Factoring Integers (Q4019632) (← links)
- Euclid’s algorithm and the Lanczos method over finite fields (Q4210963) (← links)
- Growth Functions and Automatic Groups (Q4347270) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- The black-box Niederreiter algorithm and its implementation over the binary field (Q4417166) (← links)
- The irreducibility of some level 1 Hecke polynomials (Q4529717) (← links)
- Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes (Q5285856) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)