First Page | Document Content | |
---|---|---|
Date: 2001-10-11 06:26:21 | Computer assisted proof of optimal approximability results Uri Zwick ∗ 3-SAT and a 21 + ratio for MAX 3-CSP are both NP-hard tasks. In [KZ97] and [Zwi98] it was shown that the validity We obtain computer assisted proAdd to Reading ListSource URL: www.cs.tau.ac.ilDownload Document from Source WebsiteFile Size: 118,72 KBShare Document on Facebook |