Date: 2016-01-03 06:44:56Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1Add to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source Website File Size: 1,14 MBShare Document on Facebook
|