Pages that link to "Item:Q3746790"
From MaRDI portal
The following pages link to Solving sparse linear equations over finite fields (Q3746790):
Displaying 50 items.
- The space complexity analysis in the general number field sieve integer factorization (Q278727) (← links)
- The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake (Q295658) (← links)
- Implicitization of curves and (hyper)surfaces using predicted support (Q385002) (← links)
- Discrete logarithm problem using index calculus method (Q445390) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- Reconstructing a phylogenetic level-1 network from quartets (Q486621) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Factoring: algorithms, computations, and computers (Q547500) (← links)
- On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
- Dynamic Galois theory (Q607055) (← links)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- On index calculus algorithms for subfield curves (Q832332) (← links)
- Index calculus in the trace zero variety (Q895005) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation (Q898244) (← links)
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← 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)
- Measuring and computing natural generators for homology groups (Q1037782) (← 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)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Sparse FGLM algorithms (Q1711988) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- A note on the factorization method of Niederreiter (Q1779329) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← 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)
- New results on quasi-subfield polynomials (Q1979951) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Probabilistic analysis of block Wiedemann for leading invariant factors (Q2048159) (← links)
