![](https://www.pdfsearch.io/img/0f495681267e379eba85f32b018b454b.jpg) Date: 2013-10-01 17:28:18
| | Complexity of k -SAT Russell Impagliazzo, Ramamohan Paturiy University of California, San Diego k-SAT [9, 8, 5, 13, 14, 10, 11, 15] exhibit increasing complexity as k increases. In particular, the best of these results Add to Reading ListSource URL: cseweb.ucsd.eduDownload Document from Source Website File Size: 114,24 KBShare Document on Facebook
|