Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q4927153> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- Q4927153 subject Q6975251.
- Q4927153 abstract "In computer science, the block Lanczos algorithm is an algorithm for finding the nullspace of a matrix over a finite field, using only multiplication of the matrix by long, thin matrices. Such matrices are considered as vectors of tuples of finite-field entries, and so tend to be called 'vectors' in descriptions of the algorithm.The block Lanczos algorithm is amongst the most efficient methods known for finding nullspaces, which is the final stage in integer factorization algorithms such as the quadratic sieve and number field sieve, and its development has been entirely driven by this application.".
- Q4927153 wikiPageWikiLink Q1151850.
- Q4927153 wikiPageWikiLink Q140770.
- Q4927153 wikiPageWikiLink Q190524.
- Q4927153 wikiPageWikiLink Q21198.
- Q4927153 wikiPageWikiLink Q2914509.
- Q4927153 wikiPageWikiLink Q366640.
- Q4927153 wikiPageWikiLink Q44337.
- Q4927153 wikiPageWikiLink Q470485.
- Q4927153 wikiPageWikiLink Q4846249.
- Q4927153 wikiPageWikiLink Q4927177.
- Q4927153 wikiPageWikiLink Q600590.
- Q4927153 wikiPageWikiLink Q603880.
- Q4927153 wikiPageWikiLink Q6975251.
- Q4927153 wikiPageWikiLink Q8366.
- Q4927153 comment "In computer science, the block Lanczos algorithm is an algorithm for finding the nullspace of a matrix over a finite field, using only multiplication of the matrix by long, thin matrices.".
- Q4927153 label "Block Lanczos algorithm".