'3 colorable' presentation slideshows

The PCP Theorem by Gap Amplification

701 views • 56 slides

Lower Bounds for Property Testing

Lower Bounds for Property Testing. Luca Trevisan U.C. Berkeley Joint work with Andrej Bogdanov and Kenji Obata. Sub-linear Time Algorithms. Want to design algorithms that run in less than linear time (and so cannot read entire input). Must be probabilistic and approximate

478 views • 36 slides

Lower Bounds for Property Testing

Lower Bounds for Property Testing. Luca Trevisan U.C. Berkeley Joint work with Andrej Bogdanov and Kenji Obata. Sub-linear Time Algorithms. Want to design algorithms that run in less than linear time (and so cannot read entire input). Must be probabilistic and approximate

461 views • 36 slides

hardness of testing 3-colorability in bounded degree graphs

377 views • 24 slides