Pages that link to "Item:Q3928238"
From MaRDI portal
The following pages link to Worst-case complexity bounds for algorithms in the theory of integral quadratic forms (Q3928238):
Displayed 15 items.
- On the computation of quadratic 2-class groups (Q679092) (← links)
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases (Q1081304) (← links)
- A hierarchy of polynomial time lattice basis reduction algorithms (Q1101500) (← links)
- A key-exchange system based on imaginary quadratic fields (Q1112782) (← links)
- Iterated ring class fields and the icosahedron (Q1141182) (← links)
- An algorithm for finding a shortest vector in a two-dimensional modular lattice (Q1318688) (← links)
- The optimal LLL algorithm is still polynomial in fixed dimension. (Q1401288) (← links)
- Short vectors of planar lattices via continued fractions (Q1603456) (← links)
- A linear algorithm for integer programming in the plane (Q1771307) (← links)
- On the parametrization of solutions of quadratic equations (Q2433590) (← links)
- Identification and signatures based on NP-hard problems of indefinite quadratic forms (Q3612243) (← links)
- A Rigorous Time Bound for Factoring Integers (Q4019632) (← links)
- Density computations for real quadratic units (Q4889938) (← links)
- Smallest Reduction Matrix of Binary Quadratic Forms (Q4931639) (← links)
- Selected Applications of LLL in Number Theory (Q5188543) (← links)