Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.
Johannes Blmer
,
Jean-Pierre Seifert
Venue
A*
STOC
Year
1999
Proceedings
STOC
DBLP record
conf/stoc/BlomerS99 ↗
Browse the full
STOC paper archive
.