Are there NP-complete problems with polynomial expected time solutions?
Posted by Steve Kroon, at cstheory.stackexchange.com,
Are there any NP-complete problems for which an algorithm is known that the expected running time is polynomial (for some…
The LLL Algorithm
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 The History of the LLL-Algorithm
-
Altmetric BadgeChapter 2 Hermite’s Constant and Lattice Algorithms
-
Altmetric BadgeChapter 3 Probabilistic Analyses of Lattice Reduction Algorithms
-
Altmetric BadgeChapter 4 Progress on LLL and Lattice Reduction
-
Altmetric BadgeChapter 5 Floating-Point LLL: Theoretical and Practical Aspects
-
Altmetric BadgeChapter 6 LLL: A Tool for Effective Diophantine Approximation
-
Altmetric BadgeChapter 7 Selected Applications of LLL in Number Theory
-
Altmetric BadgeChapter 8 The van Hoeij Algorithm for Factoring Polynomials
-
Altmetric BadgeChapter 9 The LLL Algorithm and Integer Programming
-
Altmetric BadgeChapter 10 Using LLL-Reduction for Solving RSA and Factorization Problems
-
Altmetric BadgeChapter 11 Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
-
Altmetric BadgeChapter 12 The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance
-
Altmetric BadgeChapter 13 Cryptographic Functions from Worst-Case Complexity Assumptions
-
Altmetric BadgeChapter 14 Inapproximability Results for Computational Problems on Lattices
-
Altmetric BadgeChapter 15 On the Complexity of Lattice Problems with Polynomial Approximation Factors