Online order basis algorithm and its impact on the block Wiedemann algorithm
From MaRDI portal
Publication:3452395
DOI10.1145/2608628.2608647zbMath1325.68281OpenAlexW2015497178MaRDI QIDQ3452395
Pascal Giorgi, Romain Lebreton
Publication date: 11 November 2015
Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01232873/file/report-GioLeb.pdf
Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Matrices over function rings in one or more variables (15A54) Online algorithms; streaming algorithms (68W27)
Related Items
A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Block-Krylov techniques in the context of sparse-FGLM algorithms ⋮ A probabilistic algorithm for verifying polynomial middle product in linear time ⋮ An improved parallel block Lanczos algorithm over GF(2) for integer factorization ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- Cylindrical algebraic decomposition using validated numerics
- The Jordan Curve Theorem, Formally and Informally
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Definability and decision problems in arithmetic
This page was built for publication: Online order basis algorithm and its impact on the block Wiedemann algorithm