Font size: Αα Αα Αα hide gadgets
You are here: Courses » ΜΞ11. Non-approximability of NP-hard problems Anonymously browsing from at 04:20:13, 19-02-2018. login

ΜΞ11. Non-approximability of NP-hard problems

Given in semesters

semester teaching students
2011-2012, fall semester Efstathios Zachos 1


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.