Approximation Schemes in Minor Free Graphs - Professor Christian Sommer - Alogrithem - Lectures 8 of 23 - Video-lecture

Video-lecture, Algorithms

Description: The lecture is about Algorithm. In this lecture Professor Christian Sommer tells ud about the subprogram in Euclid's algorithm to compute the remainder would execute much faster if the programmer had a "modulus" (division) instruction available rather than just subtraction (or worse: just Minsky's "decrement"). Lecture8 of 23
Document information