Abstract | ||
---|---|---|
Given a k-dimensional subspace MRn and a full rank integer lattice LRn, the subspace |
Year | Venue | Keywords |
---|---|---|
2008 | Clinical Orthopaedics and Related Research | data structure,computational complexity |
Field | DocType | Volume |
Rank (linear algebra),Discrete mathematics,Combinatorics,Parameterized complexity,Exact algorithm,Upper and lower bounds,Dimension function,Lattice problem,Norm (mathematics),Integer lattice,Mathematics | Journal | abs/0804.4 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
V. Arvind | 1 | 122 | 12.03 |
Pushkar S. Joglekar | 2 | 35 | 5.69 |