ロード中...
Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL
The LLL basis reduction algorithm was the first polynomial-time algorithm to compute a reduced basis of a given lattice, and hence also a short vector in the lattice. It approximates an NP-hard problem where the approximation quality solely depends on the dimension of the lattice, but not the lattic...
保存先:
| 出版年: | J Autom Reason |
|---|---|
| 主要な著者: | , , , , , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Springer Netherlands
2020
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7413592/ https://ncbi.nlm.nih.gov/pubmed/32831440 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s10817-020-09552-1 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|