4 search results - page 1 / 1 » Finite Vector Spaces and Certain Lattices |
COMBINATORICS
1998
14 years 9 months ago
1998
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF(q). When q is prime, we prove that Gn(q) is equal to...
JCT
2010
14 years 4 months ago
2010
Let Sm be the set of symmetric bilinear forms on an m-dimensional vector space over GF(q), where q is a power of two. A subset Y of Sm is called an (m, d)-set if the difference of...
SODA
2012
ACM
13 years 1 days ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
80
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...