Everything about Block Wiedemann algorithm

🧭 Start here: a 6-step reading path

1. Read the overview: Block Wiedemann algorithmA 5-minute orientation
2. Read the landmark paper: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann AlgorithmCited 57 times
3. Go sideways: Grothendieck inequalityA closely related topic
4. Go sideways: Semidefinite programmingA closely related topic

🏆 Landmark papers (most cited)

• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm

  Don Coppersmith · 1994 · Mathematics of Computation · 57 citations

• Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm

  Emmanuel Thomé · 2002 · Journal of Symbolic Computation · 37 citations

• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems

  Erich Kaltofen · 1995 · Mathematics of Computation · 30 citations

• Parallel GNFS algorithm integrated with parallel block Wiedemann algorithm for RSA security in cloud computing

  Laurence T. Yang, Gaoyuan Huang, Jun Feng · 2017 · Information Sciences · 27 citations

• Solving homogeneous linear equations over 𝐺𝐹(2) via block Wiedemann algorithm

  Don Coppersmith · 1994 · Mathematics of Computation · 23 citations

• Analysis of Coppersmith’s block Wiedemann algorithm for the parallel solution of sparse linear systems

  Erich Kaltofen · 1995 · Mathematics of Computation · 8 citations

• Iterative sparse matrix–vector multiplication for accelerating the block Wiedemann algorithm over GF(2) on multi‐graphics processing unit systems

  Bertil Schmidt, Hans Aribowo, Hoang‐Vu Dang · 2012 · Concurrency and Computation: Practice and Experience · 5 citations

• Block Wiedemann algorithm on multicore architectures

  Bastien Vialla · 2014 · ACM Communications in Computer Algebra · 1 citations

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• Grothendieck inequality In mathematics, the Grothendieck inequality states that there is a universal constant K G {\displaystyle K_{G}} with the following property. If Mij is…
• Semidefinite programming Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified…
• Constant-recursive sequence In mathematics, an infinite sequence of numbers s 0 , s 1 , s 2 , s 3 , … {\displaystyle s_{0},s_{1},s_{2},s_{3},\ldots } is called constant-recursive…
• Ideal lattice In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many…
• Karmarkar–Karp bin packing algorithms The Karmarkar–Karp (KK) bin packing algorithms are several related approximation algorithm for the bin packing problem. The bin packing problem is a problem…
• Muirhead's inequality In mathematics, Muirhead's inequality, named after Robert Franklin Muirhead, also known as the "bunching" method, generalizes the inequality of arithmetic…
• Coding theory approaches to nucleic acid design DNA code construction refers to the application of coding theory to the design of nucleic acid systems for the field of DNA–based computation. DNA sequences…
• Power iteration In mathematics, power iteration (also known as the power method) is an eigenvalue algorithm: given a diagonalizable matrix A {\displaystyle A} , the algorithm…