STOC 1999 - PDF Preprint Papers

STOC 1999 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-1999 Paper

click to vote

STOC
1999
ACM

176views Algorithms» more STOC 1999»

On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice

13 years 8 months ago

Download www.csie.nuk.edu.tw

Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...

Johannes Blömer, Jean-Pierre Seifert

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	176	On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice	claim
2	132	A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow	claim
3	125	Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut	claim
4	123	Covering Rectilinear Polygons with Axis-Parallel Rectangles	claim
5	122	Oblivious Transfer and Polynomial Evaluation	claim
6	106	Scheduling in the Dark	claim
7	105	Algorithmic Mechanism Design (Extended Abstract)	claim
8	104	Fast Approximate PCPs	claim
9	101	Short Proofs are Narrow - Resolution Made Simple	claim
10	101	Sublinear Time Algorithms for Metric Space Problems	claim
11	87	Scheduling Data Transfers in a Network and the Set Scheduling Problem	claim
12	85	A Theorem on Sensitivity and Applications in Private Computation	claim
13	81	PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability	claim
14	80	Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems	claim
15	75	Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes	claim
16	74	Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers