mpla.math.uoa.gr
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 54.166.203.17 at 10:44:33, 26-09-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

Exams

Comments

You must be logged in to comment.

Reporter

Page updates

No recent updates.

Feeds RSS and Atom feeds

posts
all posts RSS
news RSS
announcements RSS
website news RSS
events
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.