Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362)
From MaRDI portal
(Redirected from Item:Q3557048)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Gradual sub-lattice reduction and a new complexity for factoring polynomials |
scientific article; zbMATH DE number 5702180
- Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Gradual sub-lattice reduction and a new complexity for factoring polynomials |
scientific article; zbMATH DE number 5702180 |
|
Statements
Gradual sub-lattice reduction and a new complexity for factoring polynomials (English)
0 references
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials (English)
0 references
26 April 2012
0 references
27 April 2010
0 references
lattice reduction
0 references
algorithmic complexity
0 references
polynomial factorization
0 references
algebraic number reconstruction
0 references
knapsack lattices
0 references
0 references
0.9999998
0 references
0.92075205
0 references
0.9080199
0 references
0.89459336
0 references
0.89073944
0 references
0.89018774
0 references
