'Poly log' presentation slideshows

A Deterministic Polynomial-time Primality Test

549 views • 38 slides

Short PCPs verifiable in Polylogarithmic Time

Short PCPs verifiable in Polylogarithmic Time. Eli Ben-Sasson, TTI Chicago & Technion Oded Goldreich, Weizmann Prahladh Harsha, Microsoft Research Madhu Sudan, MIT Salil Vadhan, Harvard. h. h. T. T. x. x. -. -. e. e. o. o. r. r. e. e. m. m. 1. [. (. ). ]. 9. L.

427 views • 34 slides

Deciding Primality is in P

399 views • 29 slides

Deciding Primality is in P

393 views • 29 slides

Deciding Primality is in P

367 views • 24 slides

L p -Sampling

L p -Sampling. David Woodruff IBM Almaden Joint work with Morteza Monemizadeh TU Dortmund. Given a stream of updates (i, a) to coordinates i of an n -dimensional vector x |a| < poly(n) a is an integer stream length < poly(n)

341 views • 21 slides

L p -Sampling

L p -Sampling. David Woodruff IBM Almaden Joint work with Morteza Monemizadeh TU Dortmund. Given a stream of updates (i, a) to coordinates i of an n -dimensional vector x |a| < poly(n) a is an integer stream length < poly(n)

216 views • 21 slides