Back to Results
First PageMeta Content
Computational 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 1
Add to Reading List

Document Date: 2016-01-03 06:44:56

Open Document

File Size: 1,14 MB

Share Result on Facebook
UPDATE