Notes for the course advanced algorithms

Notes for the course advanced algorithms (2000)

by Johan Hastad

Citations:

1 - 0 self

@MISC{Hastad00notesfor,
    author = {Johan Hastad},
    title = {Notes for the course advanced algorithms},
    year = {2000}
}

539	A new polynomial-time algorithm for linear programming - Karmarkar - 1984
163	Probabilistic algorithm for testing primality - Rabin - 1980
42	Gaussian elimination is not optimal. Numerische Mathematik, 13:354–356 - Strassen - 1969
37	Tensor rank is NP-Complete - H˚astad - 1990
20	An explicit lower bound for TSP with distances one andtwo - Engebretsen - 1998
10	Primality Testing And Two Dimensional Abelian Varieties Over Finite Fields - Adleman, Huang - 1992
7	Matrix multiplication via arithmeticprogressions. 19th Annual ACM Symposium on Theory of Computing - Coppersmith, Winograd - 1987
1	Time bounds forselection - Blum, Floyd, et al. - 1973
1	Breaking iterated knapsacks Advances in Cryptology, Proceed-nings of Crypto 84, Springer Verlag 1985, pp 342-358. [9 - Brickell - 1979
1	Selecting the median. Proceedings of the 6th AnnualACM-SIAM Symposium on Discrete Algorithms - Dor, Zwick - 1995
1	Gerver: Factoring Integers with a Quadratic - Goldstein - 1963
1	Almost all Primes can be Quickly Certified. STOC1986. [23 - Tarjan - 1980
1	Factoring Polynomials with RationalCoefficients - Lenstra, Lenstra, et al. - 1982
1	A Method of Factoring and the Factorization of F7.Math. Comp. (29) 1975. [39] Pollard: A Monte Carlo Method for Factorization - Morrison, Brillhart - 1975