Name
Abstract | ||
|---|---|---|
We study the algorithmic complexity of lattice problems based on the sieving technique due to Ajtai, Kumar, and Sivakumar (AKS01). Given a k-dimensional subspace M ⊆ Rn and a full rank integer lattice L ⊆ Qn, the subspace avoiding problem SAP, defined by Bl¨ |
Year | DOI | Venue |
|---|---|---|
2008 | 10.4230/LIPIcs.FSTTCS.2008.1738 | FSTTCS |
Field | DocType | Citations |
Rank (linear algebra),Discrete mathematics,Approximation algorithm,Combinatorics,Convex body,Lattice (order),Exact algorithm,Dimension function,Lattice problem,Integer lattice,Mathematics | Conference | 10 |
PageRank | References | Authors |
0.55 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. Arvind | 1 | 122 | 12.03 |
| Pushkar S. Joglekar | 2 | 35 | 5.69 |