FOCS 1990 - PDF Preprint Papers

FOCS 1990 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-1990 Paper

click to vote

FOCS
1990
IEEE

117views Theoretical Computer Science» more FOCS 1990»

The Lattice Reduction Algorithm of Gauss: An Average Case Analysis

13 years 8 months ago

Download www.csie.nuk.edu.tw

The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.

Brigitte Vallée, Philippe Flajolet

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	117	The Lattice Reduction Algorithm of Gauss: An Average Case Analysis	claim
2	115	Algebraic Methods for Interactive Proof Systems	claim
3	98	IP=PSPACE	claim
4	90	Decision Problems for Propositional Linear Logic	claim
5	87	Simple Constructions of Almost k-Wise Independent Random Variables	claim
6	87	Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain	claim
7	85	Perfectly Secure Message Transmission	claim
8	79	Uniform Memory Hierarchies	claim
9	78	Matrix Decomposition Problem Is Complete for the Average Case	claim
10	74	Time-Space Tradeoffs for Undirected Graph Traversal	claim
11	73	Communication-Space Tradeoffs for Unrestricted Protocols	claim
12	71	On the Predictability of Coupled Automata: An Allegory about Chaos	claim
13	67	The Computability and Complexity of Optical Beam Tracing	claim
14	66	Randomness in Interactive Proofs	claim
15	65	Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time	claim
16	64	Complexity of Unification in Free Groups and Free Semi-groups	claim
17	64	Triangulating a Simple Polygon in Linear Time	claim
18	63	Security Preserving Amplification of Hardness	claim
19	62	Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract)	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers