This is a static snapshot of the website of MPLA, taken on 2025-02-27.
You are here: Courses » ΜΞ11. Non-approximability of NP-hard problems

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

Given in semesters

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

Comments

Reporter

Web standards: XHTML1.0, CSS3.
© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.