Font size: Αα Αα Αα hide gadgets
You are here: Courses » 2011-2012 » fall semester » ΜΞ11. Non-approximability of NP-hard problems (2011-2012, fall semester) Anonymously browsing from at 23:02:19, 21-11-2018. login

Non-approximability of NP-hard problems: 2011-2012, fall semester

For information about this course in general (not just for this specific semester), visit its page: ΜΞ11. Non-approximability of NP-hard problems.

Taught by: Efstathios Zachos

Teaching hours

We apologize, but we cannot remember the weekly schedule of this course.

Enrolled students



You must be logged in to comment.


Page updates

No recent updates.

Feeds RSS and Atom feeds

all posts RSS
news RSS
announcements RSS
website news RSS
all events RSS
defenses RSS
exams RSS
seminars RSS
graduations RSS
Web standards: XHTML1.0, CSS3.
© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.