ConceptTheory & Algos
Fully PTAS
A fully polynomial time approximation scheme is a PTAS whose running time is polynomial in both n and 1/epsilon.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.