Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

How to Calculate Shortest Vectors in a Lattice

From MaRDI portal
Publication:4063520
Jump to:navigation, search

DOI10.2307/2005293zbMath0306.10012OpenAlexW4240074965MaRDI QIDQ4063520

Ulrich Dieter

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/2005293



Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Random number generation in numerical analysis (65C10) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Minima of forms (11H50)


Related Items

Efficient lattice assessment for LCG and GLP parameter searches ⋮ New dense superball packings in three dimensions ⋮ Zur Beziehung zwischen Basen und Vektoren kürzester Länge in Gittern ⋮ Upper bounds in spectral test for multiple recursive random number generators with missing terms ⋮ On finite-precision representations of geometric objects ⋮ The shortest vector problem and tame kernels of cyclotomic fields ⋮ Calculation of Minkowski-reduced lattice bases ⋮ Simultaneous reduction of a lattice basis and its reciprocal basis ⋮ Search for combinatorial objects using lattice algorithms -- revisited



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4063520&oldid=17802872"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 05:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki